Well-covered graphs with constraints on \(\Delta\) and \(\delta\)

DOI10.1007/s00224-023-10140-0zbMath1530.05152OpenAlexW4386224059MaRDI QIDQ6185607

Vadim E. Levit, David Tankus

Publication date: 8 January 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-023-10140-0

zbMATH Keywords

vector spacemaximal independent setgenerating subgraphrelating edgeweighted well-covered graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Well-covered claw-free graphs
• 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
• 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 Vector Spaces of Graphs
• Some covering concepts in graphs
• Recognizing Generating Subgraphs Revisited

This page was built for publication: Well-covered graphs with constraints on \(\Delta\) and \(\delta\)