Disjoint cliques and disjoint maximal independent sets of vertices in graphs
type: Item
instance of: scholarly article
title: Disjoint cliques and disjoint maximal independent sets of vertices in graphs
zbMATH Open document ID: 0493.05049
DOI: 10.1016/0012-365X(82)90053-X
author: S. Singh
published in: Discrete Mathematics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3775575
zbMATH Keywords: maximal sets of cliques
zbMATH Keywords: regular graph
zbMATH Keywords: maximal independent sets
MaRDI profile type: Publication
cites work: Q5422499
cites work: Disjoint independent dominating sets in graphs
cites work: Q4766997
cites work: Coverings by minimal transversals
full work available at URL: 0012-365x(82)90053-x
OpenAlex ID: W2116396312
Wikidata QID: Q130485085
Recommended article: On disjoint maximal independent sets in graphs
Recommended article: Maximal independent sets in clique-free graphs
Recommended article: On graphs admitting two disjoint maximum independent sets
Recommended article: Disjoint cliques in claw-free graphs
Recommended article: On disjoint maximum and maximal independent sets in graphs and inverse independence number
Recommended article: Q4838814
Recommended article: GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS
Recommended article: Q3137191
Recommended article: On the number of edge disjoint cliques in graphs of given size
Recommended article: Independent sets, cliques, and colorings in graphons
description: scientific article; zbMATH DE number 3775575