Abstract
A vertex colouring C 1, C 2,…, C k of a graph G is called l- bounded ( l⩾0) if | C i⧹N(u)|⩽l for all i=1,2,…, k and for every vertex u∈VG⧹ C i ; here N( u) is the neighbourhood of u. Let C( k, l) be the class of all graphs having an l-bounded k-colouring. We show that for all k and l the class C( k, l) can be described in terms of forbidden induced subgraphs. This result implies the existence of polynomial time algorithms recognizing C( k, l). We also find the minimal set of forbidden induced subgraphs for the class C(3,1).
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.
