Disjoint cliques and disjoint maximal independent sets of vertices in graphs

DOI10.1016/0012-365X(82)90053-XzbMath0493.05049OpenAlexW2116396312MaRDI QIDQ1168336

S. Singh

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90053-x

zbMATH Keywords

regular graphmaximal independent setsmaximal sets of cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On graphs admitting two disjoint maximum independent sets ⋮ Disjoint dominating sets with a perfect matching ⋮ On disjoint maximal independent sets in graphs ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ On graph fall-coloring: existence and constructions ⋮ Graph partition into small cliques ⋮ 1-well-covered graphs revisited

Cites Work

• Disjoint independent dominating sets in graphs
• Coverings by minimal transversals
• Unnamed Item
• Unnamed Item