The generalized acyclic edge chromatic number of random regular graphs

DOI10.1002/jgt.20167zbMath1109.05043OpenAlexW4238743912MaRDI QIDQ3419704

Catherine Greenhill, Stefanie Gerke, Nicholas C. Wormald

Publication date: 7 February 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20167

zbMATH Keywords

random graphsedge coloringacyclic coloring

Mathematics Subject Classification ID

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

Related Items (5)

Improved bounds on the generalized acyclic chromatic number ⋮ Generalised acyclic edge colourings of graphs with large girth ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Bounds on the generalised acyclic chromatic numbers of bounded degree graphs

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Unnamed Item
• Unnamed Item

This page was built for publication: The generalized acyclic edge chromatic number of random regular graphs