Abstract
AbstractMotivated by a satellite communications problem, we consider a generalized coloring problem on unit disk graphs. A coloring is k‐improper if no more than k neighbors of every vertex have the same colour as that assigned to the vertex. The k‐improper chromatic number χk(G) is the least number of colors needed in a k‐improper coloring of a graph G. The main subject of this work is analyzing the complexity of computing χk for the class of unit disk graphs and some related classes, e.g., hexagonal graphs and interval graphs. We show NP‐completeness in many restricted cases and also provide both positive and negative approximability results. Because of the challenging nature of this topic, many seemingly simple questions remain: for example, it remains open to determine the complexity of computing χk for unit interval graphs. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
