Acyclic and tree unique colourings in random graphs

DOI10.56947/GJOM.V16I2.1867MaRDI QIDQ6549437zbMATH OpenFDO

Authors Ghurumuruhan Ganesan

Publication date 3 June 2024

Published in Gulf Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.56947/GJOM.V16I2.1867

zbMATH Keywords

acyclic chromatic numbercriticalityrandom graphtree unique colourings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Acyclic coloring of graphs
• The generalized acyclic edge chromatic number of random regular graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1
• Acyclic edge colourings of graphs with large girth

This page was built for publication: Acyclic and tree unique colourings in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549437)