Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques

DOI10.1007/978-3-030-61792-9_46OpenAlexW3109610612MaRDI QIDQ2081655

Uéverton S. Souza, Sancrey Rodrigues Alves, Fernanda Couto, Sylvain Gravier, Sulamita Klein, Luérbio Faria

Publication date: 13 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-61792-9_46

zbMATH Keywords

recognitionwell-covered\((k,\ell)\)-graphsandwich problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (4)

On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Partitions and well-coveredness: the graph sandwich problem

This page was built for publication: Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques