On 4-connected claw-free well-covered graphs

DOI10.1016/0166-218X(94)00117-VzbMath0859.05051OpenAlexW2019017547MaRDI QIDQ1917239

Michael D. Plummer, Bert L. Hartnell

Publication date: 7 April 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

greedy algorithmcharacterizationindependent setrecognitionconnected graphwell-covered graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items (7)

WELL-COVERED GRAPHS: A SURVEY ⋮ Equimatchable claw-free graphs ⋮ On the structure of 4-regular planar well-covered graphs ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ A revision and extension of results on 4-regular, 4-connected, claw-free graphs ⋮ A characterization of well-covered graphs in terms of forbidden costable subgraphs ⋮ The Clique Corona Operation and Greedoids

Cites Work

• Matching theory
• A characterization of well covered graphs of girth 5 or greater
• Strongly well-covered graphs
• Complexity results for well‐covered graphs
• Randomly matchable graphs
• WELL-COVERED GRAPHS: A SURVEY
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On 4-connected claw-free well-covered graphs