Pages that link to "Item:Q3061190"
From MaRDI portal
The following pages link to K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190):
Displaying 8 items.
- Three-colourable perfect graphs without even pairs (Q412165) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)