Abstract
An independent set S is maximal if it is not a proper subset of an independent set, while S is maximum if it has a maximum size. The problem of whether a graph has a pair of disjoint maximal independent sets was introduced by Berge in the early 1970s. The class of graphs for which every induced subgraph admits two disjoint maximal independent sets was characterized by Schaudt in 2015. In this paper, we are focused on finding conditions ensuring the existence of two disjoint maximum independent sets.
Original language | English |
---|---|
Article number | P1.01 |
Journal | Art of Discrete and Applied Mathematics |
Volume | 6 |
Issue number | 1 |
DOIs | |
State | Published - 2023 |
Keywords
- König-Egervàry graph
- Maximum independent set
- almost bipartite graph
- shedding vertex
- unicyclic graph