Some structural properties of very well-covered graphs

MaRDI QIDQ5443167zbMATH OpenFDO

Authors Vadim E. Levit, Eugen Mandrescu

Publication date 20 February 2008

zbMATH Keywords

girth of a graphKönig-Egerváry graphmatchingsimple graphstable setvery well-covered graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1472162
• Publication:4940016
• A characterization of well covered graphs of girth 5 or greater
• scientific article; zbMATH DE number 1286748
• Very well-covered graphs of girth at least four and local maximum stable set greedoids

Cited in

(8)

• A characterization of well covered graphs of girth 5 or greater
• The cyclomatic number of a graph and its independence polynomial at - 1
• Critical sets, crowns and local maximum independent sets
• Properties of vertex cover obstructions
• Local maximum stable set greedoids stemming from very well-covered graphs
• scientific article; zbMATH DE number 2068161 (Why is no real title available?)
• Crowns in bipartite graphs
• Characterization of \(Z_m\)-well-covered graphs for some classes of graphs

This page was built for publication: Some structural properties of very well-covered graphs

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