On disjoint maximal independent sets in graphs

DOI10.1016/J.IPL.2014.08.010MaRDI QIDQ458376zbMATH OpenOpenAlexFDO

Authors 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

dominating setindependent setcombinatorial problemsforbidden induced subgraph

Mathematics Subject Classification ID

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

Recommendations

• On graphs admitting two disjoint maximum independent sets
• Polar graphs and maximal independent sets
• Cohabitation of independent sets and dominating sets in trees
• Trees with two disjoint minimum independent dominating sets
• On minimum dominating sets with minimum intersection

Cites work

• scientific article; zbMATH DE number 5531984 (Why is no real title available?)
• scientific article; zbMATH DE number 3442096 (Why is no real title available?)
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint independent dominating sets in graphs
• Remarks about disjoint dominating sets

Cited in

(12)

• On graphs admitting two disjoint maximum independent sets
• 1-well-covered graphs revisited
• The \(0-1\) inverse maximum independent set problem on forests and unicyclic graphs
• Acyclic total dominating sets in cubic graphs
• Maximal independent sets in clique-free graphs
• MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
• Disjoint subgraphs of large maximum degree
• scientific article; zbMATH DE number 6870675 (Why is no real title available?)
• Polar graphs and maximal independent sets
• On disjoint maximum and maximal independent sets in graphs and inverse independence number
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Cohabitation of independent sets and dominating sets in trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458376)