Well-covered graphs without cycles of lengths 4, 5 and 6

DOI10.1016/j.dam.2015.01.001zbMath1311.05163arXiv1210.6918OpenAlexW2963412337MaRDI QIDQ2345607

Vadim E. Levit, David Tankus

Publication date: 22 May 2015

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

Full work available at URL: https://arxiv.org/abs/1210.6918

zbMATH Keywords

independent setwell-covered graphgenerating subgraphrelating edge

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• The well-covered dimension of products of graphs
• Weighted well-covered claw-free graphs
• Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
• A characterization of well covered graphs of girth 5 or greater
• The structure of well-covered graphs and the complexity of their recognition problems
• Very well covered graphs
• Well-covered claw-free graphs
• 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
• WELL-COVERED GRAPHS: A SURVEY
• 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: Well-covered graphs without cycles of lengths 4, 5 and 6