Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
From MaRDI portal
Publication:5325950
DOI10.1002/JGT.21683zbMATH Open1269.05041OpenAlexW1545401050MaRDI QIDQ5325950FDOQ5325950
Authors: Qiaojun Shu, Weifan Wang, Yiqiao 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
Recommendations
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic chromatic indices of planar graphs with girth at least five
- Further result on acyclic chromatic index of planar graphs
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic chromatic index of planar graphs with triangles
- An improved bound on acyclic chromatic index of planar graphs
- Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
- Improved bounds for acyclic chromatic index of planar graphs
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic chromatic indices of \(K_4\)-minor free graphs
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) 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?)
- Acyclic colorings of subcubic graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Some results on acyclic edge coloring of plane graphs
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic chromatic indices of planar graphs with large girth
- 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 planar graphs with \(\varDelta\) colors
- 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
Cited In (27)
- Acyclic edge coloring of 1-planar graphs without 4-cycles
- A note on acyclic number of planar graphs
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
- Further result on acyclic chromatic index of planar graphs
- Acyclic chromatic indices of 2-outerplane graphs
- Local conditions for planar graphs of acyclic edge coloring
- Acyclic edge colouring of plane graphs
- Acyclic chromatic indices of planar graphs with girth at least five
- Acyclic edge coloring of graphs
- Acyclic edge coloring of IC-planar graphs
- Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic edge coloring of planar graphs with girth at least 5
- Acyclic edge coloring of triangle-free 1-planar graphs
- Acyclic edge-coloring of planar graphs
- Acyclic chromatic indices of \(K_4\)-minor free 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 chromatic indices of planar graphs with large girth
- Acyclic edge coloring of 4-regular graphs. II.
- Group chromatic number of planar graphs of girth at least 4
- 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
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic edge-colouring of planar graphs (extended abstract)
- Title not available (Why is that?)
- Acyclic edge coloring of 4-regular graphs without 3-cycles
This page was built for publication: Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325950)
