Acyclic chromatic indices of planar graphs with girth at least five

DOI10.1007/s10878-010-9354-2zbMath1245.90136OpenAlexW2083273257MaRDI QIDQ434197

Qiaojun Shu, Wei Fan Wang

Publication date: 10 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9354-2

zbMATH Keywords

girthplanar graphmaximum degreeacyclic edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4, Acyclic edge coloring of planar graphs without 5-cycles, An improved bound on acyclic chromatic index of planar graphs, Acyclic edge coloring of planar graphs without 4-cycles, Acyclic edge coloring of 4-regular graphs without 3-cycles, Acyclic edge coloring of IC-planar graphs, Acyclic edge coloring of triangle-free 1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Acyclic edge colouring of planar graphs without short cycles
• About acyclic edge colourings of planar graphs
• Acyclic edge coloring of planar graphs with large girth
• Algorithmic aspects of acyclic edge colorings
• Acyclic chromatic indices of planar graphs with large girth
• Acyclic edge colorings of graphs
• Acyclic edge-colouring of planar graphs. Extended abstract
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic coloring of graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1