论文信息 - On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph

On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph

We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least five in this class is 3-colorable.

Nicolas Trotignon | Kristina Vuskovic

[1] Daniela Kühn,et al. Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree , 2004, Comb..

[2] Nicolas Trotignon,et al. Graphs that do not contain a cycle with a node that has at least two neighbors on it , 2013, SIAM J. Discret. Math..

[3] Nicolas Trotignon,et al. On graphs with no induced subdivision of K4 , 2012, J. Comb. Theory, Ser. B.