Header menu link for other important links
X
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs
Published in John Wiley and Sons Inc
2021
Volume: 97
   
Issue: 4
Pages: 553 - 556
Abstract
The closed neighborhood conflict-free chromatic number of a graph (Formula presented.), denoted by (Formula presented.), is the minimum number of colors required to color the vertices of (Formula presented.) such that for every vertex, there is a color that appears exactly once in its closed neighborhood. Pach and Tardos showed that (Formula presented.), for any (Formula presented.), where (Formula presented.) is the maximum degree. In 2014, Glebov et al. showed existence of graphs (Formula presented.) with (Formula presented.). In this article, we bridge the gap between the two bounds by showing that (Formula presented.). © 2021 Wiley Periodicals LLC
About the journal
JournalData powered by TypesetJournal of Graph Theory
PublisherData powered by TypesetJohn Wiley and Sons Inc
ISSN03649024