On \(r\)-acyclic edge colorings of planar graphs

DOI10.1016/j.dam.2012.04.015zbMath1246.05063OpenAlexW2103337822MaRDI QIDQ442224

Gui Zhen Liu, Yong Yu, Xin Zhang, Guang-Hui Wang, Jin-bo Li

Publication date: 10 August 2012

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

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

zbMATH Keywords

planar graphseriesouterplanar graph\(r\)-acyclic edge coloringparallel graph

Mathematics Subject Classification ID

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

Related Items (2)

Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ The \(r\)-acyclic chromatic number of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Generalised acyclic edge colourings of graphs with large girth
• About acyclic edge colourings of planar graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Colorings and girth of oriented planar graphs
• List edge-colorings of series-parallel graphs
• Planar graphs of maximum degree seven are Class I
• Topology of series-parallel networks
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• The entire coloring of series-parallel graphs
• Acyclic edge-colouring of planar graphs. Extended abstract
• Bounds on Edge Colorings with Restrictions on the Union of Color Classes
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic Edge-Coloring of Planar Graphs
• The generalized acyclic edge chromatic number of random regular graphs
• Acyclic coloring of graphs
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On \(r\)-acyclic edge colorings of planar graphs