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

DOI10.1007/S10878-014-9765-6MaRDI QIDQ489715zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cyclesmaximum degreeplanar graphacyclic edge coloring

Mathematics Subject Classification ID

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

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

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?)
• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• Acyclic coloring of graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge coloring of planar graphs without 5-cycles
• Acyclic edge coloring of sparse graphs
• Acyclic edge coloring of subcubic graphs
• Acyclic edge colorings of graphs
• Acyclic edge-coloring of planar graphs
• Acyclic edge-coloring using entropy compression
• Improved bounds on coloring of 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
• Acyclic edge coloring of planar graphs without 5-cycles
• Local conditions for planar graphs of acyclic edge coloring
• Acyclic edge coloring of planar graphs without adjacent cycles
• Acyclic edge coloring of planar graphs without adjacent triangles
• Acyclic edge coloring of planar graphs without small cycles
• An acyclic edge coloring of a planar graph
• Acyclic edge coloring of chordal graphs with bounded degree
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• 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)