Acyclic chromatic indices of planar graphs with girth at least five

Qiaojun Shu and Weifan Wang ()
Additional contact information
Qiaojun Shu: Zhejiang Normal University
Weifan Wang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2012, vol. 23, issue 1, No 10, 140-157

Abstract: Abstract An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a′(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. In this paper, we prove that every planar graph G with girth g(G)≥5 and maximum degree Δ≥12 has a′(G)=Δ.

Keywords: Acyclic edge coloring; Planar graph; Girth; Maximum degree (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9354-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:23:y:2012:i:1:d:10.1007_s10878-010-9354-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9354-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().