Asymptotic Enumeration ofk-Edge-Coloredk-Regular Graphs

DOI10.1137/080725556zbMath1207.05061OpenAlexW2021112424MaRDI QIDQ3058554

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

graph coloringasymptotic enumerationmatchings

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)

Factorisation of the complete graph into spanning regular factors ⋮ Deranged Matchings: Proofs and Conjectures

This page was built for publication: Asymptotic Enumeration ofk-Edge-Coloredk-Regular Graphs