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

DOI10.1007/S10878-014-9765-6zbMATH Open1337.90076OpenAlexW2077232859MaRDI QIDQ489715FDOQ489715

Authors: Qiaojun Shu, Wenwen Zhang, Jian-Liang Wu, Yiqiao 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

Recommendations

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

zbMATH Keywords

cyclesmaximum degreeplanar graphacyclic edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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?)
• Title not available (Why is that?)
• Acyclic edge-coloring using entropy compression
• Improved bounds on coloring of graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge coloring of sparse graphs
• Acyclic edge coloring of subcubic graphs
• Acyclic edge-coloring of planar graphs
• Acyclic edge coloring of planar graphs without 5-cycles
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• A new upper bound on the acyclic chromatic indices of planar graphs

Cited In (14)

• 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
• Local conditions for planar graphs of acyclic edge coloring
• Acyclic edge coloring of planar graphs without 5-cycles
• Acyclic edge coloring of planar graphs without adjacent cycles
• Acyclic edge coloring of planar graphs without adjacent triangles
• An acyclic edge coloring of a planar graph
• Acyclic edge coloring of planar graphs without small 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
• Acyclic edge coloring of chordal graphs with bounded degree
• The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
• Acyclic edge coloring of 4-regular graphs without 3-cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489715)