Recognizing \(\text{W}_2\) graphs

DOI10.1007/S00373-024-02777-6zbMATH Open1544.05078MaRDI QIDQ6580488

Vadim E. Levit, David Tankus

Publication date: 29 July 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

maximal independent setsshedding vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weighted well-covered claw-free graphs
• On maximal independent sets of vertices in claw-free graphs
• A characterization of well covered graphs of girth 5 or greater
• \(W_2\)-graphs and shedding vertices
• Well-covered claw-free graphs
• 1-well-covered graphs revisited
• 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
• Vertex decomposable graphs and obstructions to shellability
• Complexity results for well‐covered graphs
• On some subclasses of well-covered graphs
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• On graphs admitting two disjoint maximum independent sets
• Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs

This page was built for publication: Recognizing \(\text{W}_2\) graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580488)