scientific article; zbMATH DE number 1286748
From MaRDI portal
Publication:4243055
zbMath0930.05068MaRDI QIDQ4243055
Publication date: 30 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (23)
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 ⋮ On the structure of 4-regular planar well-covered graphs ⋮ Strong cliques in vertex‐transitive graphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ On well-covered triangulations. I ⋮ On the Cartesian product of non well-covered graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Well-located graphs: A collection of well-covered ones ⋮ A note on graphs contraction-critical with respect to independence number ⋮ Triangulations and equality in the domination chain ⋮ On well-covered Cartesian products ⋮ On well-covered pentagonalizations of the plane ⋮ On well-covered triangulations. II. ⋮ On well-covered triangulations. III ⋮ A revision and extension of results on 4-regular, 4-connected, claw-free graphs ⋮ Well-totally-dominated graphs ⋮ Detecting strong cliques ⋮ Mind the independence gap ⋮ Unnamed Item ⋮ On regular-stable graphs
This page was built for publication:
