Optimal r-dynamic coloring of sparse graphs
Dan Yi,
Junlei Zhu (),
Lixia Feng,
Jiaxin Wang and
Mengyini Yang
Additional contact information
Dan Yi: Jiaxing University
Junlei Zhu: Jiaxing University
Lixia Feng: Jiaxing University
Jiaxin Wang: Jiaxing University
Mengyini Yang: Jiaxing University
Journal of Combinatorial Optimization, 2019, vol. 38, issue 2, No 11, 545-555
Abstract:
Abstract An r-dynamick-coloring of a graphG is a proper k-coloring such that every vertex v in V(G) has neighbors in at least $$min\{d(v),r\}$$ m i n { d ( v ) , r } different classes. The r-dynamic chromatic number ofG, written $$\chi _{r}(G)$$ χ r ( G ) , is the minimum integer k such that G has such a coloring. In this paper, we investigate the r-dynamic $$(r+1)$$ ( r + 1 ) -coloring (i.e. optimal r-dynamic coloring) of sparse graphs and prove that $$\chi _{r}(G)\le r+1$$ χ r ( G ) ≤ r + 1 holds if G is a planar graph with $$g(G)\ge 7$$ g ( G ) ≥ 7 and $$r\ge 16$$ r ≥ 16 , which is a generalization of the case $$r=\Delta $$ r = Δ .
Keywords: Girth; Sparse graph; r-Dynamic coloring (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00387-0 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:38:y:2019:i:2:d:10.1007_s10878-019-00387-0
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-019-00387-0
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 ().