Recommendations
Cites work
- A characterization of well covered graphs of girth 5 or greater
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Complexity results for well‐covered graphs
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3614795 (Why is no real title available?)
- scientific article; zbMATH DE number 637286 (Why is no real title available?)
- scientific article; zbMATH DE number 1472162 (Why is no real title available?)
- scientific article; zbMATH DE number 205349 (Why is no real title available?)
- scientific article; zbMATH DE number 749261 (Why is no real title available?)
- scientific article; zbMATH DE number 786167 (Why is no real title available?)
- scientific article; zbMATH DE number 1409179 (Why is no real title available?)
- Independent domination and matchings in graphs
- Matching theory
- On Representatives of Subsets
- On well-covered graphs of odd girth 7 or greater
- Recursively decomposable well-covered graphs
- Regular factors of simple regular graphs and factor-spectra
- Regular graphs, regular factors, and the impact of Petersen's theorems
- Regularisable Graphs
- Some covering concepts in graphs
- The 1-Factors of Oriented Graphs
- Very well covered graphs
- Well-covered graphs and extendability
- WELL-COVERED GRAPHS: A SURVEY
Cited in
(7)- The existence of path-factor covered graphs
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Licci squarefree monomial ideals generated in degree two or with deviation two
- Extending Berge's and Favaron's results about well-covered graphs
- scientific article; zbMATH DE number 21731 (Why is no real title available?)
- Gorenstein homogeneous subrings of graphs
- Regular edges, matchings and Hilbert series
This page was built for publication: Well-covered graphs and factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492219)