Pages that link to "Item:Q1712540"
From MaRDI portal
The following pages link to A note on chromatic number of (cap, even hole)-free graphs (Q1712540):
Displaying 8 items.
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190) (← links)
- (Q5740788) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Polynomial bounds for chromatic number VII. Disjoint holes (Q6081574) (← links)
- On the chromatic number of a family of odd hole free graphs (Q6670771) (← links)