Strongly well-covered graphs

DOI10.1016/0012-365X(94)90240-2zbMath0824.05054MaRDI QIDQ1336664

Michael R. Pinter

Publication date: 9 November 1995

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

zbMATH Keywords

independent setindependent numberwell-covered graphsstrongly well-covered graphwell-cover

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (2)

On 4-connected claw-free well-covered graphs ⋮ Partitions and well-coveredness: the graph sandwich problem

Cites Work

• A characterization of well covered graphs of girth 5 or greater
• Well-covered graphs and extendability
• Very well covered graphs
• On some subclasses of well-covered graphs
• A class of planar well‐covered graphs with girth four
• Some covering concepts in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly well-covered graphs