Generalized acyclic edge colorings via entropy compression

Laihao Ding, Guanghui Wang () and Jianliang Wu
Additional contact information
Laihao Ding: Shandong University
Guanghui Wang: Shandong University
Jianliang Wu: Shandong University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 3, No 14, 906-920

Abstract: Abstract An r-acyclic edge coloring of a graph G is a proper edge coloring such that any cycle C has at least $$\min \{|C|,r\}$$ min { | C | , r } colors. The least number of colors needed for an r-acyclic edge coloring of G is called the r-acyclic edge chromatic number or the r-acyclic chromatic index of G, denoted by $$A'_{r}\left( G\right) $$ A r ′ G . In this paper, we study the r-acyclic edge chromatic number with $$r\ge 4$$ r ≥ 4 and prove that $$A'_{r}\left( G\right) \le 2\Delta ^{\lfloor \tfrac{r}{2}\rfloor }+O\left( \Delta ^{\tfrac{r+1}{3}}\right) $$ A r ′ G ≤ 2 Δ ⌊ r 2 ⌋ + O Δ r + 1 3 . We also prove that when r is even, $$A'_{r}\left( G\right) \le \Delta ^{\tfrac{r}{2}}+O\left( \Delta ^{\tfrac{r+1}{3}}\right) $$ A r ′ G ≤ Δ r 2 + O Δ r + 1 3 , which is asymptotically optimal. In addition, we investigate how the r-acyclic edge chromatic number performs as the girth increases. It is proved in this paper that for every graph G with girth at least $$2r-1$$ 2 r - 1 , $$A'_r\left( G\right) \le \left( 9r-7\right) \Delta +10r-12$$ A r ′ G ≤ 9 r - 7 Δ + 10 r - 12 holds. Our approach is based on the entropy compression method.

Keywords: r-Acyclic edge coloring; Entropy compression; List coloring; Large girth (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0244-8 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:35:y:2018:i:3:d:10.1007_s10878-017-0244-8

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

DOI: 10.1007/s10878-017-0244-8

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 ().