Acyclic edge coloring of planar graphs without 5-cycles

DOI10.1016/J.DAM.2011.12.016MaRDI QIDQ423934zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

girthmaximum degreeplanar graphacyclic edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Acyclic edge coloring of planar graphs without 4-cycles
• An acyclic edge coloring of a planar graph
• Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
• Acyclic edge coloring of planar graphs without small cycles
• The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle

Cites work

• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• scientific article; zbMATH DE number 1775440 (Why is no real title available?)
• About acyclic edge colourings of planar graphs
• Acyclic Edge Colouring of Outerplanar Graphs
• Acyclic chromatic indices of \(K_4\)-minor free graphs
• Acyclic chromatic indices of planar graphs with girth at least five
• Acyclic chromatic indices of planar graphs with large girth
• Acyclic coloring of graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic edge coloring of planar graphs with large girth
• Acyclic edge coloring of planar graphs without small cycles
• Acyclic edge coloring of subcubic graphs
• Acyclic edge coloring of triangle-free planar graphs
• Acyclic edge colorings of graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic edge colouring of planar graphs without short cycles
• Acyclic edge-coloring of planar graphs
• Choosability and edge choosability of planar graphs without five cycles
• Some results on acyclic edge coloring of plane graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1

Cited in

(22)

• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge coloring of 1-planar graphs without 4-cycles
• Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
• Acyclic chromatic indices of 2-outerplane graphs
• Acyclic edge colouring of plane graphs
• Local conditions for planar graphs of acyclic edge coloring
• Acyclic edge colouring of planar graphs without short cycles
• Acyclic edge coloring of planar graphs without adjacent cycles
• Acyclic edge coloring of graphs
• An improved bound on acyclic chromatic index of planar graphs
• Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
• Acyclic edge coloring of planar graphs with girth at least 5
• Acyclic edge coloring of planar graphs without small cycles
• An acyclic edge coloring of a planar graph
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• scientific article; zbMATH DE number 6178442 (Why is no real title available?)
• 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 sparse graphs
• Acyclically edge color triangle-free toroidal graphs in + 2 colors
• 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)