Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
type: Item
instance of: scholarly article
title: Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
zbMATH Open document ID: 1209.05185
author: Vadim E. Levit
author: David Tankus
published in: Discrete Applied Mathematics
publication date: 2011-03-10T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5864313
zbMATH Keywords: well-covered graph
zbMATH Keywords: relating edge
zbMATH Keywords: generating subgraph
zbMATH Keywords: independent set
zbMATH Keywords: hereditary system
MaRDI profile type: Publication
full work available at URL: j.dam.2010.11.009
OpenAlex ID: W1606558748
cites work: The structure of well-covered graphs with no cycles of length 4
cites work: Local Structure When All Maximal Independent Sets Have Equal Weight
cites work: Recognizing Greedy Structures
cites work: Q3139761
cites work: Well-covered graphs and extendability
cites work: A characterization of well covered graphs of girth 5 or greater
cites work: A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
cites work: Q3424781
cites work: On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
cites work: Well covered simplicial, chordal, and circular arc graphs
cites work: Complexity results for well‐covered graphs
cites work: Well-covered claw-free graphs
cites work: The structure of well-covered graphs and the complexity of their recognition problems
cites work: Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
DOI: 10.1016/J.DAM.2010.11.009
description: scientific article; zbMATH DE number 5864313