scientific article; zbMATH DE number 3859176

MaRDI QIDQ3328581zbMATH OpenFDO

Authors Mark Ramras

Publication date 1983

zbMATH Keywords

independence ratiopartition into chordless cycles

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• Maximal k-independent sets in graphs
• Coverings, matchings and the number of maximal independent sets of graphs
• Maximal independent sets in the covering graph of the cube
• On the number of maximal independent sets in a graph
• Maximal independent sets in clique-free graphs
• Maximizing the number of independent sets of fixed size in Kn‐covered graphs
• Maximal independent sets and regularity of graphs
• On the number of maximum independent sets of graphs
• On the maximum number of maximum independent sets in connected graphs
• The number of maximum independent sets in graphs

Cited in

(2)

• On locally optimal independent sets and vertex covers
• Maximizing the number of independent sets of fixed size in Kn‐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 Q3328581)