Abstract
AbstractLet be the maximum order of an odd induced subgraph of . In 1992, Scott proposed a conjecture that for a graph of order without isolated vertices, where is the chromatic number of . In this paper, we show that the conjecture is not true for bipartite graphs, but is true for all line graphs. In addition, we also disprove a conjecture of Berman, Wang, and Wargo in 1997, which states that for a connected graph of order . Scott's conjecture is open for graphs with chromatic number at least 3.
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.
