Weighted well-covered graphs without cycles of lengths 5, 6 and 7

DOI10.1016/j.ipl.2021.106189OpenAlexW3193319368MaRDI QIDQ2059877

David Tankus

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106189

zbMATH Keywords

vector spacegraph algorithmsmaximal independent setgenerating subgraphweighted well-covered graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted well-covered claw-free graphs
• Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
• Complexity results for generating subgraphs
• A characterization of well covered graphs of girth 5 or greater
• The structure of well-covered graphs and the complexity of their recognition problems
• Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
• Well-covered graphs without cycles of lengths 4, 5 and 6
• On relating edges in graphs without cycles of length 4
• 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
• Some covering concepts in graphs

This page was built for publication: Weighted well-covered graphs without cycles of lengths 5, 6 and 7