Pages that link to "Item:Q4575707"
From MaRDI portal
The following pages link to Obstructions for three-coloring graphs with one forbidden induced subgraph (Q4575707):
Displaying 16 items.
- CriticalPfreeGraphs (Q38700) (← links)
- Three forbidden subgraphs for line graphs (Q1613508) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- 3-colourability and forbidden subgraphs (Q2816134) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)