Strong cliques in diamond-free graphs

DOI10.1007/978-3-030-60440-0_21OpenAlexW3111758979MaRDI QIDQ5918595

Nina Chiarelli, Jérôme Monnot, Berenice Martínez-Barona, Peter Mursic, Martin Milanič

Publication date: 21 December 2022

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-60440-0_21

zbMATH Keywords

maximal stable setNP-hard problemmaximal cliquestrong cliquediamond-free graphlinear-time algorithmCIS graphsimplicial cliqueErdős-Hajnal property

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Strong cliques in diamond-free graphs

This page was built for publication: Strong cliques in diamond-free graphs