Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

DOI10.1007/S10878-012-9524-5MaRDI QIDQ2015791zbMATHOpenAlexFDO

Authors Ping Sheng, Yingqian Wang

Publication date 24 June 2014

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

Full work available at URL https://doi.org/10.1007/s10878-012-9524-5

zbMATH Keywords

planar graph4-cyclesacyclic edge coloring

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Acyclic edge coloring of planar graphs without 4-cycles
• The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• Acyclic edge coloring of planar graphs without 5-cycles

Cites work

• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• About acyclic edge colourings of planar graphs
• Acyclic chromatic index of planar graphs with triangles
• Acyclic edge colorings of graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic edge colouring of planar graphs without short cycles
• Acyclic edge-coloring of planar graphs
• Graph theory
• On acyclic edge coloring of planar graphs without intersecting triangles
• Some results on acyclic edge coloring of plane graphs

Cited in

(3)

• Acyclic edge coloring of sparse graphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• A new upper bound on the acyclic chromatic indices of planar graphs

This page was built for publication: Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

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