Acyclic edge coloring of planar graphs without small cycles
From MaRDI portal
Publication:1926054
DOI10.1007/s00373-011-1043-0zbMath1256.05071MaRDI QIDQ1926054
Jian-Feng Hou, Jian Liang Wu, Gui Zhen Liu
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1043-0
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Acyclic edge coloring of planar graphs without 5-cycles, Acyclic edge coloring of sparse graphs, Acyclic edge coloring of graphs with large girths, Acyclic edge coloring of planar graphs without 4-cycles, Acyclic edge coloring of graphs, Acyclic edge coloring of planar graphs without adjacent cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds for acyclic chromatic index of planar graphs
- Acyclic colorings of subcubic graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- Algorithmic aspects of acyclic edge colorings
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- A parallel algorithmic version of the local lemma
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic colorings of planar graphs