Three-coloring triangle-free graphs without long forbidden paths
From MaRDI portal
Cites work
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path
- Certifying coloring algorithms for graphs without long induced paths
- Critical \(( P_5 , \mathrm{dart} )\)-free graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs
- Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring
- Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring
- Improved complexity results on \(k\)-coloring \(P _{t }\)-free graphs
- Minimal obstructions to C₅-Coloring in hereditary graph classes
- NP completeness of finding the chromatic index of regular graphs
- Obstructions for three-coloring and list three-coloring H-free graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- Reducibility among combinatorial problems
- Some results on critical (P₅, H)-free graphs
- The NP-Completeness of Edge-Coloring
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Triangle-free 2P₃-free graphs are 4-colorable
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
This page was built for publication: Three-coloring triangle-free graphs without long forbidden paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316936)
