Colouring Random 4-Regular Graphs
From MaRDI portal
Publication:5295417
DOI10.1017/S0963548306007693zbMath1120.05037MaRDI QIDQ5295417
Ling-Sheng Shi, Nicholas C. Wormald
Publication date: 30 July 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items
Properties of regular graphs with large girth via local algorithms ⋮ Lower bounds on the chromatic number of random graphs ⋮ On the chromatic number of random regular graphs ⋮ The cook-book approach to the differential equation method ⋮ Karp–Sipser on Random Graphs with a Fixed Degree Sequence ⋮ On the chromatic number of a random 5-regular graph ⋮ On the chromatic number of random \(d\)-regular graphs ⋮ Random regular graphs of non-constant degree: concentration of the chromatic number ⋮ Minimum 2-dominating sets in regular graphs