Improved bounds on acyclic edge colouring

DOI10.1016/j.disc.2007.03.006zbMath1128.05022DBLPjournals/dm/MuthuNS07OpenAlexW2175513216WikidataQ56390693 ScholiaQ56390693MaRDI QIDQ2462375

Yanyan Li

Publication date: 30 November 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.006

zbMATH Keywords

edge colouringacyclic graphedge chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Improved bounds on the generalized acyclic chromatic number ⋮ New bounds for the acyclic chromatic index ⋮ Improved upper bounds on acyclic edge colorings ⋮ Some results on acyclic edge coloring of plane graphs ⋮ Improved bounds on coloring of graphs ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ The method of coloring in graphs and its application ⋮ Acyclic edge-coloring using entropy compression ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Improved bounds for acyclic chromatic index of planar graphs ⋮ Optimal acyclic edge colouring of grid like graphs ⋮ Acyclic edge chromatic number of outerplanar graphs ⋮ Acyclic edge colourings of graphs with large girth ⋮ Acyclic edge coloring of planar graphs with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic edge colorings of graphs
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs
• Graph colouring and the probabilistic method

This page was built for publication: Improved bounds on acyclic edge colouring