Pages that link to "Item:Q3652246"
From MaRDI portal
The following pages link to A Certifying Algorithm for 3-Colorability of P 5-Free Graphs (Q3652246):
Displaying 29 items.
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← 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)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← 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)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← 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)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← 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)
- 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)