Acyclic edge coloring of planar graphs without 4-cycles

DOI10.1007/s10878-012-9474-yzbMath1294.90067MaRDI QIDQ1956244

Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9474-y

zbMATH Keywords

cycle; planar graph; maximum degree; acyclic edge coloring

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C15: Coloring of graphs and hypergraphs

Related Items

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 planar graphs without a 3-cycle adjacent to a 6-cycle, Acyclic edge coloring of 4-regular graphs without 3-cycles, Coloring graphs without bichromatic cycles or paths, Local conditions for planar graphs of acyclic edge coloring, Acyclic edge coloring of graphs, The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle, Acyclic edge coloring of planar graphs without adjacent cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on acyclic edge coloring of plane graphs
• 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 coloring of subcubic graphs
• Acyclic edge coloring of planar graphs with large girth
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic edge coloring of planar graphs without small cycles
• 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
• 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
• Acyclic Edge Colouring of Outerplanar Graphs