Pages that link to "Item:Q965257"
From MaRDI portal
The following pages link to \(K_{4}\)-free graphs with no odd holes (Q965257):
Displaying 26 items.
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Three-colourable perfect graphs without even pairs (Q412165) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable (Q1273432) (← links)
- Coloring graphs with no \(\text{odd-}K_4\) (Q1584207) (← links)
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs (Q1633754) (← links)
- A note on chromatic number and induced odd cycles (Q1676794) (← links)
- Some problems on induced subgraphs (Q1693168) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- 2-divisibility of some odd hole free graphs (Q2155661) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190) (← links)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- Some remarks on graphs with no induced subdivision of \(K_4\) (Q6064854) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
- Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable (Q6660054) (← links)
- On the chromatic number of a family of odd hole free graphs (Q6670771) (← links)
