The $$r$$ r -acyclic chromatic number of planar graphs

Guanghui Wang (), Guiying Yan, Jiguo Yu and Xin Zhang
Additional contact information
Guanghui Wang: Shandong University
Guiying Yan: Chinese Academy of Sciences
Jiguo Yu: Qufu Normal University
Xin Zhang: Xidian University

Journal of Combinatorial Optimization, 2015, vol. 29, issue 4, No 3, 713-722

Abstract: Abstract A vertex coloring of a graph G is r-acyclic if it is a proper vertex coloring such that every cycle $$C$$ C receives at least $$\min \{|C|,r\}$$ min { | C | , r } colors. The $$r$$ r -acyclic chromatic number $$a_{r}(G)$$ a r ( G ) of $$G$$ G is the least number of colors in an $$r$$ r -acyclic coloring of $$G$$ G . Let $$G$$ G be a planar graph. By Four Color Theorem, we know that $$a_{1}(G)=a_{2}(G)=\chi (G)\le 4$$ a 1 ( G ) = a 2 ( G ) = χ ( G ) ≤ 4 , where $$\chi (G)$$ χ ( G ) is the chromatic number of $$G$$ G . Borodin proved that $$a_{3}(G)\le 5$$ a 3 ( G ) ≤ 5 . However when $$r\ge 4$$ r ≥ 4 , the $$r$$ r -acyclic chromatic number of a class of graphs may not be bounded by a constant number. For example, $$a_{4}(K_{2,n})=n+2=\Delta (K_{2,n})+2$$ a 4 ( K 2 , n ) = n + 2 = Δ ( K 2 , n ) + 2 for $$n\ge 2$$ n ≥ 2 , where $$K_{2,n}$$ K 2 , n is a complete bipartite (planar) graph. In this paper, we give a sufficient condition for $$a_{r}(G)\le r$$ a r ( G ) ≤ r when $$G$$ G is a planar graph. In precise, we show that if $$r\ge 4$$ r ≥ 4 and $$G$$ G is a planar graph with $$g(G)\ge \frac{10r-4}{3}$$ g ( G ) ≥ 10 r − 4 3 , then $$a_{r}(G)\le r$$ a r ( G ) ≤ r . In addition, we discuss the $$4$$ 4 -acyclic colorings of some special planar graphs.

Keywords: Acyclic coloring; Planar graph; Girth (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9619-7 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:29:y:2015:i:4:d:10.1007_s10878-013-9619-7

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

DOI: 10.1007/s10878-013-9619-7

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