Acyclic edge coloring of planar graphs without 5-cycles

DOI10.1016/j.dam.2011.12.016zbMath1242.05103OpenAlexW2079660141MaRDI QIDQ423934

Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.016

zbMATH Keywords

girthplanar graphmaximum degreeacyclic edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle ⋮ Acyclic edge coloring of planar graphs without adjacent cycles ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on acyclic edge coloring of plane graphs
• Acyclic chromatic indices of planar graphs with girth at least five
• 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 subcubic graphs
• Acyclic edge coloring of planar graphs with large girth
• Acyclic edge colorings of planar graphs and series parallel graphs
• Choosability and edge choosability of planar graphs without five cycles
• Acyclic edge coloring of planar graphs without small cycles
• Acyclic chromatic indices of planar graphs with large girth
• Acyclic edge colorings of graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic Edge-Coloring of Planar Graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic coloring of graphs
• Acyclic Edge Coloring of Triangle‐Free Planar Graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1
• Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs
• Acyclic Edge Colouring of Outerplanar Graphs

This page was built for publication: Acyclic edge coloring of planar graphs without 5-cycles