๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the number of edge-colourings of regular bipartite graphs

โœ Scribed by A. Schrijver

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
562 KB
Volume
38
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The rainbow number of matchings in regul
The rainbow number of matchings in regular bipartite graphs
โœ Xueliang Li; Zhixia Xu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular

On the number of irreducible coverings b
On the number of irreducible coverings by edges of complete bipartite graphs
โœ Ioan Tomescu ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.

On two-factors of bipartite regular grap
On two-factors of bipartite regular graphs
โœ J.D. Horton ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 654 KB

The set of two-factors of a bipartite k-regular graph, k > 2, spans the cycle space of the graph. In addition, a new non-hamiltonian T-connected bicubic graph on 92 vertices is constructed.