Edge-colouring random graphs

DOI10.1016/0095-8956(88)90065-2zbMath0656.05054OpenAlexW2011601766WikidataQ57401614 ScholiaQ57401614MaRDI QIDQ1109790

Bruce A. Reed, Colin J. H. McDiarmid, Bill Jackson, Alan M. Frieze

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90065-2

zbMATH Keywords

regular graphrandom graphchromatic indexperfect matchingclass 2

Mathematics Subject Classification ID

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

Related Items

Random perfect graphs, Goldberg's conjecture is true for random multigraphs

Cites Work

• Degree sequences of random graphs
• On the chromatic index of almost all graphs
• The NP-Completeness of Edge-Coloring
• Paths, Trees, and Flowers
• On the existence of a factor of degree one of a connected random graph
• The Factorization of Linear Graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item