scientific article; zbMATH DE number 205349
From MaRDI portal
Publication:4693382
zbMath0788.05077MaRDI QIDQ4693382
No author found.
Publication date: 30 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
characterisationpolynomial time algorithmmaximal independent setsco-NP-completewell-covered cubic graphs
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (23)
Strongly well-covered graphs ⋮ Well-covered triangulations. IV ⋮ 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-hued graphs ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ The minimal spectral radius of graphs with a given diameter ⋮ A classification of 1-well-covered graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ On the structure of 4-regular planar well-covered graphs ⋮ Well-covered circulant graphs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Graphs vertex-partitionable into strong cliques ⋮ Graphs in which all maximal bipartite subgraphs have the same order ⋮ On vertex decomposable and Cohen-Macaulay regular graphs ⋮ On well-covered Cartesian products ⋮ On well-covered pentagonalizations of the plane ⋮ Well-covered graphs and factors ⋮ The face pair of planar graphs ⋮ Detecting strong cliques ⋮ Unnamed Item ⋮ On well-covered direct products
This page was built for publication:
