Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)

DOI10.1016/j.dam.2010.11.009zbMath1209.05185OpenAlexW1606558748MaRDI QIDQ628320

David Tankus, Vadim E. Levit

Publication date: 10 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.009

zbMATH Keywords

independent setwell-covered graphhereditary systemgenerating subgraphrelating edge

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ Weighted well-covered claw-free graphs ⋮ Complexity results for generating subgraphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6

Cites Work

• Unnamed Item
• Unnamed Item
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
• A characterization of well covered graphs of girth 5 or greater
• Well-covered graphs and extendability
• The structure of well-covered graphs and the complexity of their recognition problems
• Well-covered claw-free graphs
• The structure of well-covered graphs with no cycles of length 4
• On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
• Complexity results for well‐covered graphs
• Local Structure When All Maximal Independent Sets Have Equal Weight
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Recognizing Greedy Structures
• Well covered simplicial, chordal, and circular arc graphs

This page was built for publication: Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)