Abstract
It is well-known that the minimum number of vertices for a triangle-free 4-chromatic graph is 11, and the Grötzsch graph is just such a graph. In this paper, we show that every non-bipartite triangle-free graph G of order not greater than 10 has χ l ( G ) = 3 . Combined with a known result by Hanson et al. [D. Hanson, G. MacGillivray, B. Toft, Choosability of bipartite graphs, Ars Combin. 44 (1996) 183–192] that every bipartite graph of order not greater than 13 is 3-choosable, we conclude that the minimum number of vertices for a triangle-free graph with χ l ( G ) = 4 is also 11.
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.
