scientific article; zbMATH DE number 1286748

MaRDI QIDQ4243055zbMATH OpenFDO

Authors Bert L. Hartnell

Publication date 30 January 2000

zbMATH Keywords

covergirthindependent setmaximum independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• WELL-COVERED GRAPHS: A SURVEY
• Publication:3211344
• A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
• Well covered simplicial, chordal, and circular arc graphs

Cited in

(35)

• On well-covered triangulations. I
• Well-located graphs: A collection of well-covered ones
• Graphs vertex-partitionable into strong cliques
• On well-covered Cartesian products
• On the Cartesian product of non well-covered graphs
• On the structure of 4-regular planar well-covered graphs
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• Detecting strong cliques
• A note on graphs contraction-critical with respect to independence number
• scientific article; zbMATH DE number 5914964 (Why is no real title available?)
• scientific article; zbMATH DE number 4191722 (Why is no real title available?)
• Well-covered triangulations. IV
• Well-totally-dominated graphs
• On regular-stable graphs
• On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
• Extending Berge's and Favaron's results about well-covered graphs
• Independent protection in graphs
• WELL-COVERED GRAPHS: A SURVEY
• scientific article; zbMATH DE number 1472162 (Why is no real title available?)
• Constructions for well-covered graphs
• Covering step graph
• Triangulations and equality in the domination chain
• A classification of 1-well-covered graphs
• scientific article; zbMATH DE number 7308162 (Why is no real title available?)
• On well-covered pentagonalizations of the plane
• Some structural properties of very well-covered graphs
• Strong cliques in vertex‐transitive graphs
• Computing well-covered vector spaces of graphs using modular decomposition
• Distinct sizes of maximal independent sets on graphs with restricted girth
• Well-forced graphs
• Well-failed graphs
• Mind the independence gap
• The well-covered dimension of random graphs
• On well-covered triangulations. II.
• On well-covered triangulations. III

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 Q4243055)