Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle

DOI10.1007/S10878-014-9765-6zbMath1337.90076OpenAlexW2077232859MaRDI QIDQ489715

Wenwen Zhang, Qiaojun Shu, Jian Liang Wu, Yi Qiao Wang

Publication date: 21 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-014-9765-6

zbMATH Keywords

cyclesplanar graphmaximum degreeacyclic edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Acyclic edge coloring of planar graphs without 5-cycles
• 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

This page was built for publication: Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle