Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques
type: Item
instance of: scholarly article
title: Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques
DOI: 10.1007/978-3-030-61792-9_46
author: Sancrey Rodrigues Alves
author: F. Couto
author: Sylvain Gravier
author: Sulamita Klein
author: Uéverton S. Souza
author: Luerbio Faria
publication date: 2022-10-13T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7600805
zbMATH Keywords: well-covered
zbMATH Keywords: \((k,\ell)\)-graph
zbMATH Keywords: sandwich problem
zbMATH Keywords: recognition
MaRDI profile type: Publication
full work available at URL: 978-3-030-61792-9 46
OpenAlex ID: W3109610612
description: scientific article; zbMATH DE number 7600805