Pages that link to "Item:Q1096639"
From MaRDI portal
The following pages link to A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639):
Displaying 10 items.
- Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
- On weakly diamond-free Berge graphs (Q1126205) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- Coloring perfect degenerate graphs (Q1356545) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- On the quasi-locally paw-free graphs (Q1810626) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Precoloring extension for<i>K</i><sub>4</sub>-minor-free graphs (Q3633010) (← links)