Asymptotic enumeration of k-edge-colored k-regular graphs

DOI10.1137/080725556MaRDI QIDQ3058554zbMATH OpenOpenAlexFDO

Authors Jeanette C. McLeod

Publication date 3 December 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080725556

zbMATH Keywords

asymptotic enumerationgraph coloringmatchings

Mathematics Subject Classification ID

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

Recommendations

• Subgraphs of random k-edge-coloured k-regular graphs
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• scientific article; zbMATH DE number 1506501
• On the perfect matchings of near regular graphs
• Almost regular edge colorings and regular decompositions of complete graphs

Cited in

(4)

• Factorisation of the complete graph into spanning regular factors
• Subgraphs of random k-edge-coloured k-regular graphs
• Deranged Matchings: Proofs and Conjectures
• Counting deranged matchings

This page was built for publication: Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058554)