scientific article; zbMATH DE number 2159638

zbMath1059.05044arXivmath/0306178MaRDI QIDQ4667604

Alastair Farrugia, Vladimir E. Alekseev, Vadim V. Lozin

Publication date: 20 April 2005

Full work available at URL: https://arxiv.org/abs/math/0306178

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

zbMATH Keywords

NP-completenessPolynomial algorithmGeneralized graph coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Inductive graph invariants and approximation algorithms ⋮ Generalized Coloring of Permutations ⋮ Minimization and parameterized variants of vertex partition problems on graphs ⋮ Stable-\(\Pi\) partitions of graphs ⋮ Graph partitions with prescribed patterns ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

This page was built for publication: