Coloring graphs with forbidden induced subgraphs
From MaRDI portal
Publication:4589007
zbMATH Open1373.05061MaRDI QIDQ4589007FDOQ4589007
Publication date: 6 November 2017
Recommendations
- Coloring graphs characterized by a forbidden subgraph
- Coloring graphs characterized by a forbidden subgraph
- On the complexity of 4-coloring graphs without long induced paths
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- scientific article; zbMATH DE number 2044943
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)
Cited In (18)
- Parameterized Pre-Coloring Extension and List Coloring Problems
- Title not available (Why is that?)
- Colouring H-free graphs of bounded diameter.
- Interval vertex-coloring of a graph with forbidden colors
- Title not available (Why is that?)
- Colouring \((P_r + P_s)\)-free graphs
- Colouring diamond-free graphs
- Colouring graphs of bounded diameter in the absence of small cycles
- Colouring graphs of bounded diameter in the absence of small cycles
- 4-colorability of \(P_6\)-free graphs
- Colouring (P_r+P_s)-Free Graphs
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- List-coloring -- parameterizing from triviality
- Open Problems on Graph Coloring for Special Graph Classes
- The complexity of coloring graphs without long induced paths
- Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring
- Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring
- Colorful induced subgraphs
This page was built for publication: Coloring graphs with forbidden induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589007)
