Pages that link to "Item:Q2175802"
From MaRDI portal
The following pages link to The chromatic number of graphs with no induced subdivision of \(K_4\) (Q2175802):
Displaying 10 items.
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Chromatic number of ISK4-free graphs (Q1696549) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- Counting \(K_4\)-subdivisions (Q2515581) (← links)
- (Q2993903) (← links)
- Nonseparating <i>K</i><sub>4</sub>‐subdivisions in graphs of minimum degree at least 4 (Q4553735) (← links)
- Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (Q5241606) (← links)
- Totally odd \(K_4\)-subdivisions in 4-chromatic graphs (Q5955212) (← 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)