Abstract
In 2012, Leveque, Maffray and Trotignon conjectured that if a graph does not contain an induced subdivision of $$K_4$$, then it is 4-colorable. Recently, Le showed that every such graph is 24-colorable. In this paper, we improve the upper bound to 8.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
