Cliques, colouring and satisfiability: from structure to algorithms

DOI10.1017/9781108592376.008MaRDI QIDQ5058669zbMATH OpenOpenAlexFDO

Authors Vadim Lozin

Publication date 21 December 2022

Full work available at URL https://www.cambridge.org/core/books/topics-in-algorithmic-graph-theory/cliques-colouring-and-satisfiability-from-structure-to-algorithms/F2773F18E178DF84AFF3DBA506B753A9

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• On the query complexity of clique size and maximum satisfiability
• scientific article; zbMATH DE number 5305148 (Why is no real title available?)
• scientific article; zbMATH DE number 939919 (Why is no real title available?)
• scientific article; zbMATH DE number 7559420 (Why is no real title available?)
• Structural parameterizations of clique coloring

This page was built for publication: Cliques, colouring and satisfiability: from structure to algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058669)