On 4-connected claw-free well-covered graphs

DOI10.1016/0166-218X(94)00117-VMaRDI QIDQ1917239zbMATH OpenOpenAlexFDO

Authors 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 algorithmconnected graphcharacterizationindependent setrecognitionwell-covered graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 786177
• Well-covered claw-free graphs
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• On factors of 4-connected claw-free graphs
• Clique coverings and claw-free graphs
• Pancyclicity of 4-connected claw-free net-free graphs
• Quadrangularly connected claw-free graphs
• On quadrilaterals and 4-path in claw-free graphs
• scientific article; zbMATH DE number 1753165
• scientific article; zbMATH DE number 1766820

Cites work

• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• scientific article; zbMATH DE number 436079 (Why is no real title available?)
• scientific article; zbMATH DE number 3873377 (Why is no real title available?)
• scientific article; zbMATH DE number 4135992 (Why is no real title available?)
• scientific article; zbMATH DE number 637341 (Why is no real title available?)
• scientific article; zbMATH DE number 2548 (Why is no real title available?)
• scientific article; zbMATH DE number 786177 (Why is no real title available?)
• 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
• Matching theory
• Randomly matchable graphs
• Strongly well-covered graphs
• WELL-COVERED GRAPHS: A SURVEY

Cited in

(14)

• scientific article; zbMATH DE number 786177 (Why is no real title available?)
• The independence number of connected (claw, \(K_4\))-free 4-regular graphs
• The Clique Corona Operation and Greedoids
• On the structure of 4-regular planar well-covered graphs
• Equimatchable claw-free graphs
• Local maximum stable set greedoids stemming from very well-covered graphs
• Weighted well-covered claw-free graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• On quadrilaterals and 4-path in claw-free graphs
• scientific article; zbMATH DE number 1409193 (Why is no real title available?)
• On the structure of graphs without claw, \(4K_1\) and co-R
• WELL-COVERED GRAPHS: A SURVEY
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917239)