AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has at leastƒ(k)n 1-factorizations. We prove that ƒ(k)⩽k!2kk, and that equality holds if k contains no other prime factors than 2 and 3. We conjecture equality for each k
We consider the following question: how large does n have to be to guarantee that in any two‐colorin...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
This paper gives a new and faster algorithm to find a 1-factor in a bipartite ∆-regular graph. The ...
AbstractWe show that anyk-regular bipartite graph with 2nvertices has at least(k−1)k-1kk-2nperfect m...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
International audienceIn this paper, we are interested in computing the number of edge colourings an...
It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
International audienceMotivated by some algorithmic considerations, we are interested in computing t...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
We consider the following question: how large does n have to be to guarantee that in any two‐colorin...
We consider the following question: how large does n have to be to guarantee that in any two‐colorin...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
This paper gives a new and faster algorithm to find a 1-factor in a bipartite ∆-regular graph. The ...
AbstractWe show that anyk-regular bipartite graph with 2nvertices has at least(k−1)k-1kk-2nperfect m...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
International audienceIn this paper, we are interested in computing the number of edge colourings an...
It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
International audienceMotivated by some algorithmic considerations, we are interested in computing t...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
We consider the following question: how large does n have to be to guarantee that in any two‐colorin...
We consider the following question: how large does n have to be to guarantee that in any two‐colorin...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
DOI
Add to ORKG