{"title":"Some results on 2-distance coloring of planar graphs with girth five","authors":"Zakir Deniz","doi":"10.1007/s10878-024-01169-z","DOIUrl":null,"url":null,"abstract":"<p>A vertex coloring of a graph <i>G</i> is called a 2-distance coloring if any two vertices at distance at most 2 from each other receive different colors. Suppose that <i>G</i> is a planar graph with girth 5 and maximum degree <span>\\(\\Delta \\)</span>. We prove that <i>G</i> admits a 2-distance <span>\\(\\Delta +7\\)</span> coloring, which improves the result of Dong and Lin (J Comb Optim 32(2):645–655, 2016). Moreover, we prove that <i>G</i> admits a 2-distance <span>\\(\\Delta +6\\)</span> coloring when <span>\\(\\Delta \\ge 10\\)</span>.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"34 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01169-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at distance at most 2 from each other receive different colors. Suppose that G is a planar graph with girth 5 and maximum degree \(\Delta \). We prove that G admits a 2-distance \(\Delta +7\) coloring, which improves the result of Dong and Lin (J Comb Optim 32(2):645–655, 2016). Moreover, we prove that G admits a 2-distance \(\Delta +6\) coloring when \(\Delta \ge 10\).
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.