Pages that link to "Item:Q2255047"
From MaRDI portal
The following pages link to Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047):
Displayed 22 items.
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← 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)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
- Vertex-critical \((P_5, \mathrm{chair})\)-free graphs (Q6069143) (← links)
- Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
- Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)