Acyclic edge coloring of planar graphs without 5-cycles
From MaRDI portal
Publication:423934
DOI10.1016/J.DAM.2011.12.016zbMATH Open1242.05103OpenAlexW2079660141MaRDI QIDQ423934FDOQ423934
Qiaojun Shu, Weifan Wang, Yiqiao Wang
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.016
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Some results on acyclic edge coloring of plane graphs
- Acyclic Edge Colouring of Outerplanar Graphs
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Choosability and edge choosability of planar graphs without five cycles
- Acyclic edge coloring of planar graphs without small cycles
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic chromatic indices of planar graphs with girth at least five
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs
Cited In (12)
- Acyclic edge coloring of 1-planar graphs without 4-cycles
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
- Local conditions for planar graphs of acyclic edge coloring
- Acyclic edge coloring of planar graphs without adjacent cycles
- An improved bound on acyclic chromatic index of planar graphs
- Acyclic edge coloring of planar graphs with girth at least 5
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
- Title not available (Why is that?)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
- The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
- Acyclic edge coloring of 4-regular graphs without 3-cycles
This page was built for publication: Acyclic edge coloring of planar graphs without 5-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423934)
