Improved bounds for acyclic chromatic index of planar graphs

DOI10.1016/J.DAM.2010.12.019MaRDI QIDQ534360zbMATH OpenOpenAlexFDO

Authors Jianfeng Hou, Guizhen Liu, Guanghui Wang

Publication date 17 May 2011

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

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

zbMATH Keywords

girthplanar graphacyclic edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Acyclic edge coloring of planar graphs with large girth
• An improved bound on acyclic chromatic index of planar graphs
• Acyclic chromatic indices of planar graphs with large girth
• Acyclic chromatic indices of planar graphs with girth at least five
• A new upper bound on the acyclic chromatic indices of planar graphs

Cites work

• scientific article; zbMATH DE number 1775440 (Why is no real title available?)
• About acyclic edge colourings of planar graphs
• Acyclic Edge Colouring of Outerplanar Graphs
• Acyclic and oriented chromatic numbers of graphs
• Acyclic coloring of graphs
• Acyclic colorings of subcubic graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic edge coloring of planar graphs with large girth
• Acyclic edge coloring of subcubic graphs
• Acyclic edge colorings of graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• Algorithmic aspects of acyclic edge colorings
• Estimation of sparse hessian matrices and graph coloring problems
• Improved bounds on acyclic edge colouring
• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Star coloring of graphs
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices

Cited in

(18)

• Improved upper bounds on acyclic edge colorings
• Acyclic reducible bounds for outerplanar graphs
• Improved bounds on linear coloring of plane graphs
• A polyhedral study of the acyclic coloring problem
• A polyhedral study of the acyclic coloring problem
• A new approach to compute acyclic chromatic index of certain chemical structures
• Acyclic edge colouring of plane graphs
• An improved bound on acyclic chromatic index of planar graphs
• Acyclic edge coloring of planar graphs with girth at least 5
• Acyclic edge coloring of planar graphs without small cycles
• Acyclic chromatic indices of planar graphs with large girth
• Improved bounds for the chromatic index of graphs and multigraphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• Acyclic chromatic index of planar graphs with triangles
• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic edge coloring of sparse graphs
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Acyclic edge coloring of planar graphs with large girth

This page was built for publication: Improved bounds for acyclic chromatic index of planar graphs

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