A new upper bound on the acyclic chromatic indices of planar graphs

DOI10.1016/j.ejc.2012.07.008zbMath1254.05059arXiv1205.6869OpenAlexW2005497281MaRDI QIDQ691588

Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.6869

zbMATH Keywords

maximum degreeacyclic edge coloring

Mathematics Subject Classification ID

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

Related Items (15)

Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Further result on acyclic chromatic index of planar graphs ⋮ Acyclic edge coloring of 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 ⋮ Unnamed Item ⋮ Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring of chordal graphs with bounded degree

This page was built for publication: A new upper bound on the acyclic chromatic indices of planar graphs