Rong Chen
Published 2023-05-06Version 1
In 2012, L\'ev\^eque, Maffray, and Trotignon conjectured that each graph $G$ that contains no induced subdivision of $K_4$ is $4$-colorable. In this paper, we prove that this conjecture holds when $G$ contains a $K_{1,2,3}$.
On graphs with no induced subdivision of $K_4$
The 1-2-3 Conjecture holds for graphs with large enough minimum degree
The Erdös-Sós Conjecture for Spiders
![QR code for arXiv:2305.03889 [math.CO]](http://oss.arxitics.com/images/favicon.svg)