Subgraphs of Randomk-Edge-Colouredk-Regular Graphs

DOI10.1017/S0963548309009882zbMath1197.05136OpenAlexW2118233485MaRDI QIDQ3552512

Jeanette C. McLeod, Paulette Lieby, Ian M. Wanless, Brendan D. McKay

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548309009882

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Functional limit theorems for random regular graphs

Cites Work

• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• The number of matchings in random regular graphs and bipartite graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Extending matchings in graphs: A survey
• Uniform generation of random regular graphs of moderate degree

This page was built for publication: Subgraphs of Randomk-Edge-Colouredk-Regular Graphs