On disjoint maximal independent sets in graphs

DOI10.1016/j.ipl.2014.08.010zbMath1358.05223OpenAlexW2066049837MaRDI QIDQ458376

Oliver Schaudt

Publication date: 7 October 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.08.010

zbMATH Keywords

combinatorial problemsindependent setdominating setforbidden induced subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On graphs admitting two disjoint maximum independent sets ⋮ On disjoint maximum and maximal independent sets in graphs and inverse independence number ⋮ 1-well-covered graphs revisited ⋮ Acyclic total dominating sets in cubic graphs

Cites Work

• Remarks about disjoint dominating sets
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint independent dominating sets in graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Unnamed Item
• Unnamed Item

This page was built for publication: On disjoint maximal independent sets in graphs