scientific article; zbMATH DE number 1409179

MaRDI QIDQ4940016zbMATH OpenFDO

Authors Bert L. Hartnell

Publication date 1 March 2000

zbMATH Keywords

greedy algorithmmaximum independent setwell-covered graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1409193
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• scientific article; zbMATH DE number 749261
• A class of planar well‐covered graphs with girth four
• A characterization of the 1-well-covered graphs with no 4-cycles

Cited in

(10)

• A characterization of well covered graphs of girth 5 or greater
• Well-covered graphs and factors
• The structure of well-covered graphs with no cycles of length 4
• scientific article; zbMATH DE number 637286 (Why is no real title available?)
• On almost well-covered graphs of girth at least 6
• Constructions for well-covered graphs
• scientific article; zbMATH DE number 749261 (Why is no real title available?)
• On well-covered graphs of odd girth 7 or greater
• scientific article; zbMATH DE number 786177 (Why is no real title available?)
• Some structural properties of very well-covered graphs

This page was built for publication:

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