A characterization of well-covered graphs in terms of forbidden costable subgraphs

DOI10.1007/BF02675790zbMath0971.05085OpenAlexW2004534629MaRDI QIDQ1581458

Igor Edm. Zverovich

Publication date: 2 April 2001

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02675790

zbMATH Keywords

maximal independent setswell-covered graphscostable subgraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The structure of well-covered graphs with no cycles of length 4 ⋮ Graphs with maximal induced matchings of the same size ⋮ Independent Domination in Triangle Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of well covered graphs of girth 5 or greater
• On 4-connected claw-free well-covered graphs
• Complexity results for well‐covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles

This page was built for publication: A characterization of well-covered graphs in terms of forbidden costable subgraphs