Recursively decomposable well-covered graphs

DOI10.1016/0012-365X(95)00232-LzbMath0870.05057OpenAlexW1991495793MaRDI QIDQ1356429

Lorna K. Stewart, Ramesh S. Sankaranarayana

Publication date: 17 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00232-l

zbMATH Keywords

characterizationindependent setswell-covered graphsisolated verticesrecursively decomposable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items

The well-covered dimension of random graphs ⋮ Well-covered graphs and factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Very well covered graphs
• Complexity results for well‐covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs