Strong cliques and stable sets

DOI10.1017/9781108592376.013MaRDI QIDQ5058674zbMATH OpenOpenAlexFDO

Authors Martin Milanič

Publication date 21 December 2022

Full work available at URL https://www.cambridge.org/core/books/topics-in-algorithmic-graph-theory/strong-cliques-and-stable-sets/2A48E760590D65F3BD1105C1540752A0

Mathematics Subject Classification ID

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

Cited in

(4)

• Strong cliques and equistability of EPT graphs
• Large cliques and independent sets all over the place
• Strong cliques in vertex‐transitive graphs
• Upper Clique Transversals in Graphs

This page was built for publication: Strong cliques and stable sets

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