Abstract
For a family H of graphs, a graph G is said to be H -free if G contains no member of H as an induced subgraph. We let G ̃ 3 ( H ) denote the family of connected H -free graphs having minimum degree at least 3. In this paper, we characterize the families H of connected graphs with | H | = 3 such that G ̃ 3 ( H ) is a finite family, except for the case where { K 3 , K 2 , 2 } ⊆ H . Our results give a fast algorithm determining the chromatic number of several classes of graphs with a forbidden subgraph condition imposed on.
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.
