Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
From MaRDI portal
Publication:5325950
DOI10.1002/jgt.21683zbMath1269.05041OpenAlexW1545401050MaRDI QIDQ5325950
Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang
Publication date: 31 July 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21683
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (13)
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 ⋮ 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 ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ 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 of IC-planar graphs ⋮ 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 triangle-free 1-planar graphs
Cites Work
- Unnamed Item
- Some results on acyclic edge coloring of plane graphs
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Acyclic chromatic indices of planar graphs with girth at least five
- Acyclic colorings of subcubic graphs
- 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 indices of planar graphs with large girth
- Acyclic edge colorings of graphs
- Acyclic edge-colouring of planar graphs. Extended abstract
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic coloring of graphs
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
This page was built for publication: Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4