Acyclic edge coloring of planar graphs without cycles of specific lengths

DOI10.1007/s12190-010-0448-xzbMath1295.05104OpenAlexW2143173626MaRDI QIDQ2251751

Dongxiao Yu, Yun Shu Gao

Publication date: 15 July 2014

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-010-0448-x

zbMATH Keywords

planar graphscombinatorial problemsacyclic edge coloringforbidden cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Acyclic edge colouring of planar graphs without short cycles
• Acyclic edge coloring of planar graphs with large girth
• Acyclic edge colorings of planar graphs and series parallel graphs
• Acyclic edge colorings of graphs
• Acyclic edge-colouring of planar graphs. Extended abstract
• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Estimation of sparse hessian matrices and graph coloring problems
• Acyclic coloring of graphs
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• Acyclic Edge Colouring of Outerplanar Graphs
• Acyclic colorings of planar graphs

This page was built for publication: Acyclic edge coloring of planar graphs without cycles of specific lengths