Complexity of fall coloring for restricted graph classes

DOI10.1007/978-3-030-25005-8_29zbMath1506.68077arXiv1905.04695OpenAlexW2961264588MaRDI QIDQ5919476

Christodoulos Mitillos, Juho Lauri

Publication date: 25 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityindependent dominationfall coloring

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Complexity of fall coloring for restricted graph classes