Acyclic Edge-Coloring of Planar Graphs
From MaRDI portal
Publication:3094922
DOI10.1137/090776676zbMath1294.05070OpenAlexW1653009521MaRDI QIDQ3094922
Tobias Müller, L. Sunil Chandran, Manu Basavaraju, Frédéric Havet, Nathann Cohen
Publication date: 27 October 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090776676
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Related Items (28)
Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Acyclic chromatic index of chordless graphs ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Further result on acyclic chromatic index of planar graphs ⋮ Acyclic chromatic indices of fully subdivided graphs ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of planar graphs without 4-cycles ⋮ 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: $\Delta$ Colors Suffice When $\Delta$ is Large ⋮ Unnamed Item ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ Acyclic List Edge Coloring of Graphs ⋮ Acyclic edge coloring of sparse graphs ⋮ Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles ⋮ 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: Acyclic Edge-Coloring of Planar Graphs