{"title":"On proper conflict-free colorings of IC-planar graphs","authors":"Yali Wu, Xin Zhang","doi":"10.1016/j.dam.2025.05.005","DOIUrl":null,"url":null,"abstract":"<div><div>A proper conflict-free coloring of a graph is a proper vertex coloring ensuring that for every vertex of degree at least one there exists a color that appears exactly once in its open neighborhood. An IC-planar graph is a graph that can be embedded in a plane without having any edge crossed more than once, with the condition that each vertex is linked to no more than one crossing edge. Proper conflict-free coloring has several practical applications, especially in the areas of wireless networks, frequency allocation, and scheduling problems, and IC-planarity is a powerful tool in the areas of network design, graph drawing, and visualization. This paper introduces the inaugural finding regarding the proper conflict-free coloring of IC-planar graphs, demonstrating that any such graph can be properly conflict-free colored with no more than 20 colors.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"373 ","pages":"Pages 217-223"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25002483","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
A proper conflict-free coloring of a graph is a proper vertex coloring ensuring that for every vertex of degree at least one there exists a color that appears exactly once in its open neighborhood. An IC-planar graph is a graph that can be embedded in a plane without having any edge crossed more than once, with the condition that each vertex is linked to no more than one crossing edge. Proper conflict-free coloring has several practical applications, especially in the areas of wireless networks, frequency allocation, and scheduling problems, and IC-planarity is a powerful tool in the areas of network design, graph drawing, and visualization. This paper introduces the inaugural finding regarding the proper conflict-free coloring of IC-planar graphs, demonstrating that any such graph can be properly conflict-free colored with no more than 20 colors.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.