On acyclic edge coloring of planar graphs without intersecting triangles

DOI10.1016/J.DISC.2011.07.023zbMath1238.05101OpenAlexW2058747097MaRDI QIDQ409363

Ping Sheng, Ying Qian Wang

Publication date: 13 April 2012

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

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

zbMATH Keywords

planar graphacyclic edge coloringintersecting triangles

Mathematics Subject Classification ID

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

Related Items (3)

Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of sparse graphs ⋮ Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on acyclic edge coloring of plane 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
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic edge colorings of graphs

This page was built for publication: On acyclic edge coloring of planar graphs without intersecting triangles