scientific article; zbMATH DE number 6803202

zbMath1373.05061MaRDI QIDQ4589007

Maria Chudnovsky

Publication date: 6 November 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloringinduced subgraphscoloring algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

4-colorability of \(P_6\)-free graphs ⋮ Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter ⋮ Colouring diamond-free graphs ⋮ List-coloring -- parameterizing from triviality ⋮ Colouring \((P_r + P_s)\)-free graphs ⋮ Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring ⋮ Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Colouring (P_r+P_s)-Free Graphs ⋮ Colouring H-free graphs of bounded diameter. ⋮ Open Problems on Graph Coloring for Special Graph Classes ⋮ Parameterized Pre-Coloring Extension and List Coloring Problems

This page was built for publication: