On disjoint maximal independent sets in graphs
type: Item
instance of: scholarly article
title: On disjoint maximal independent sets in graphs
zbMATH Open document ID: 1358.05223
author: Oliver Schaudt
published in: Information Processing Letters
publication date: 2014-10-07T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6352033
zbMATH Keywords: combinatorial problems
zbMATH Keywords: independent set
zbMATH Keywords: dominating set
zbMATH Keywords: forbidden induced subgraph
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.08.010
OpenAlex ID: W2066049837
cites work: Disjoint cliques and disjoint maximal independent sets of vertices in graphs
cites work: Q4766997
cites work: Disjoint independent dominating sets in graphs
cites work: Q3615799
cites work: Remarks about disjoint dominating sets
cites work: Algorithmic aspect of \(k\)-tuple domination in graphs.
DOI: 10.1016/J.IPL.2014.08.010
description: scientific article; zbMATH DE number 6352033