Pages that link to "Item:Q1427186"
From MaRDI portal
The following pages link to 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186):
Displaying 12 items.
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Choosability of P 5-Free Graphs (Q3182940) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
