Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

DOI10.1007/s10878-012-9524-5zbMath1322.90106OpenAlexW2145414142MaRDI QIDQ2015791

Ping Sheng, Ying Qian Wang

Publication date: 24 June 2014

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9524-5

zbMATH Keywords

planar graphacyclic edge coloring4-cycles

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

Acyclic edge coloring of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on acyclic edge coloring of plane graphs
• On acyclic edge coloring of planar graphs without intersecting triangles
• Acyclic edge colouring of planar graphs without short cycles
• About acyclic edge colourings of planar graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic chromatic index of planar graphs with triangles
• Acyclic edge colorings of graphs
• Acyclic Edge-Coloring of Planar Graphs

This page was built for publication: Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles