Abstract
A graph G is ( m , k ) - colourable if its vertices can be coloured with m colours such that the maximum degree of any subgraph induced on vertices receiving the same colour is at most k . The k-defective chromatic number χ k ( G ) is the least positive integer m for which G is ( m , k ) -colourable. Let f ( m , k ) be the smallest order of a triangle-free graph such that χ k ( G ) = m . In this paper we study the problem of determining f ( m , k ) . We show that f ( 3 , 2 ) = 13 and characterize the corresponding minimal graphs. We present a lower bound for f ( m , k ) for all m ≥ 3 and also an upper bound for f ( 3 , k ) .
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.
