scientific article
From MaRDI portal
Publication:3139761
zbMath0801.68119MaRDI QIDQ3139761
Václav Chvátal, Peter J. Slater
Publication date: 4 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 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)
Related Items (50)
Satgraphs and independent domination. I ⋮ It is hard to know when greedy is good for finding independent sets ⋮ Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ Well-covered triangulations. IV ⋮ Recursively decomposable well-covered graphs ⋮ The structure of well-covered graphs with no cycles of length 4 ⋮ Graphs with maximal induced matchings of the same size ⋮ The well-covered dimension of random graphs ⋮ Well-dominated graphs without cycles of lengths 4 and 5 ⋮ 1-extendability of independent sets ⋮ On 4-connected claw-free well-covered graphs ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Edge-stable equimatchable graphs ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ On CIS circulants ⋮ A classification of 1-well-covered graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ On the structure of 4-regular planar well-covered graphs ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Well-covered circulant graphs ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ On well-covered triangulations. I ⋮ Graphs vertex-partitionable into strong cliques ⋮ On relating edges in graphs without cycles of length 4 ⋮ Weighted well-covered claw-free graphs ⋮ Triangulations and equality in the domination chain ⋮ On well-covered pentagonalizations of the plane ⋮ On well-covered triangulations. II. ⋮ On well-covered triangulations. III ⋮ Well-covered graphs and factors ⋮ 1-extendability of independent sets ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Complexity results for generating subgraphs ⋮ Strong cliques in diamond-free graphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Detecting strong cliques ⋮ Mind the independence gap ⋮ Unnamed Item ⋮ A characterization of well-covered graphs in terms of forbidden costable subgraphs ⋮ The Clique Corona Operation and Greedoids ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Partitions and well-coveredness: the graph sandwich problem ⋮ The maximum ratio clique problem
This page was built for publication:
