On the number of edge-colourings of regular bipartite graphs

DOI10.1016/0012-365X(82)90295-3zbMath0489.05031MaRDI QIDQ1166536

Alexander Schrijver

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge-colouringperfect matchings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The number of matchings in random regular graphs and bipartite graphs ⋮ Counting 1-factors in regular bipartite graphs

Cites Work

• A lower bound for the permanent of a doubly stochastic matrix
• Nonisomorphic Steiner triple systems
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of edge-colourings of regular bipartite graphs