The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle

DOI10.1016/j.dam.2013.04.004zbMath1285.05072MaRDI QIDQ2444561

Qiaojun Shu, Wei Fan Wang, Yi Qiao Wang

Publication date: 10 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.004

zbMATH Keywords

cycle; planar graph; maximum degree; acyclic edge coloring

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C07: Vertex degrees

Related Items

Local conditions for planar graphs of acyclic edge coloring, Acyclic edge coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Acyclic edge coloring of planar graphs without 5-cycles
• Acyclic edge colouring of plane graphs
• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge coloring of subcubic graphs
• Acyclic edge coloring of sparse graphs
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge-coloring using entropy compression
• Acyclic edge colorings of graphs
• Acyclic Edge-Coloring of Planar Graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic coloring of graphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4