Publication:4243055
From MaRDI portal
zbMath0930.05068MaRDI QIDQ4243055
Publication date: 30 January 2000
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, Strong cliques in vertex‐transitive graphs, Well-covered triangulations. IV, 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, Triangulations and equality in the domination chain, On well-covered pentagonalizations of the plane, Mind the independence gap, On well-covered triangulations. II., On well-covered triangulations. III, 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, Well-totally-dominated graphs, On regular-stable graphs
