scientific article; zbMATH DE number 3442096
From MaRDI portal
Publication:4766997
Cited in
(9)- Disjoint cliques and disjoint maximal independent sets of vertices in graphs
- On recognizing graph properties from adjacency matrices
- Coverings by minimal transversals
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- 1-well-covered graphs revisited
- On disjoint maximal independent sets in graphs
- A structural approach for independent domination of regular graphs
- On graphs admitting two disjoint maximum independent sets
- Disjoint maximal independent sets in graphs and hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766997)