scientific article; zbMATH DE number 3614795
From MaRDI portal
Publication:4179024
zbMath0396.05007MaRDI QIDQ4179024
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (47)
Strongly well-covered graphs ⋮ On well-covered, vertex decomposable and Cohen-Macaulay graphs ⋮ Well-covered triangulations. IV ⋮ Graphs with maximal induced matchings of the same size ⋮ Well-hued graphs ⋮ 1-extendability of independent sets ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Path spectra for trees ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ Independent protection in graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Matchings, coverings, and Castelnuovo-Mumford regularity ⋮ A class of planar well‐covered graphs with girth four ⋮ On \(\alpha\)-excellent graphs ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ Extremal graphs for a new upper bound on domination parameters in graphs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Graphs in which all maximal bipartite subgraphs have the same order ⋮ A note on graphs contraction-critical with respect to independence number ⋮ Weighted well-covered claw-free graphs ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type ⋮ Neighborhood unions and regularity in graphs ⋮ Well-covered graphs and factors ⋮ On average lower independence and domination numbers in graphs ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ 1-extendability of independent sets ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Complexity results for generating subgraphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ Mind the independence gap ⋮ Very well covered graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Clique Corona Operation and Greedoids ⋮ The uniformity space of hypergraphs and its applications ⋮ Recognizing Generating Subgraphs Revisited ⋮ Domination, eternal domination, and clique covering ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Well-covered graphs and extendability ⋮ Partitions and well-coveredness: the graph sandwich problem ⋮ A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
This page was built for publication:
