Pages that link to "Item:Q5241606"
From MaRDI portal
The following pages link to Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (Q5241606):
Displaying 11 items.
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Chromatic number of ISK4-free graphs (Q1696549) (← links)
- Triangle-free \(2P_3\)-free graphs are 4-colorable (Q1939592) (← links)
- The chromatic number of graphs with no induced subdivision of \(K_4\) (Q2175802) (← links)
- Scott's induced subdivision conjecture for maximal triangle-free graphs (Q2908125) (← links)
- On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph (Q2978173) (← links)
- The chromatic number of {ISK4, diamond, bowtie}‐free graphs (Q6055409) (← links)
- Some remarks on graphs with no induced subdivision of \(K_4\) (Q6064854) (← links)
