On disjoint maximal independent sets in graphs

DOI10.1016/J.IPL.2014.08.010zbMATH Open1358.05223OpenAlexW2066049837MaRDI QIDQ458376FDOQ458376

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

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

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)

Cites Work

• Remarks about disjoint dominating sets
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Title not available (Why is that?)
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• Disjoint independent dominating sets in graphs
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Disjoint subgraphs of large maximum degree
• MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
• Acyclic total dominating sets in cubic graphs
• Polar graphs and maximal independent sets
• On graphs admitting two disjoint maximum independent sets
• Maximal independent sets in clique-free graphs
• On disjoint maximum and maximal independent sets in graphs and inverse independence number
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• 1-well-covered graphs revisited

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)