Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Cliques, colouring and satisfiability: from structure to algorithms

From MaRDI portal
Publication:5058669
Jump to:navigation, search

DOI10.1017/9781108592376.008OpenAlexW3161974430MaRDI QIDQ5058669

Vadim V. 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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)








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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5058669&oldid=19539727"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 11:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki