Well-covered claw-free graphs

From MaRDI portal
Publication:1924128

DOI10.1006/jctb.1996.0022zbMath0858.05046OpenAlexW2029046796MaRDI QIDQ1924128

Michael Tarsi, David Tankus

Publication date: 23 March 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0022



Related Items

It is hard to know when greedy is good for finding independent sets, Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP, The structure of well-covered graphs and the complexity of their recognition problems, Well-covered triangulations. IV, Graphs with maximal induced matchings of the same size, The well-covered dimension of random graphs, 1-extendability of independent sets, On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity, Extending Berge's and Favaron's results about well-covered graphs, 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, 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\), 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, On well-covered pentagonalizations of the plane, On well-covered triangulations. II., On well-covered triangulations. III, 1-extendability of independent sets, On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph, Complexity results for generating subgraphs, Greedily constructing maximal partial \(f\)-factors, On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6, Unnamed Item, 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