1-well-covered graphs containing a clique of size \(n/3\)

DOI10.5614/ejgta.2024.12.2.8MaRDI QIDQ6669819

Zakir Deniz

Publication date: 22 January 2025

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

matchingindependent setcliquewell-covered

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
• A characterization of well covered graphs of girth 5 or greater
• Very well covered graphs
• On the structure of 4-regular planar well-covered graphs
• 1-well-covered graphs revisited
• Efficient recognition of equimatchable graphs
• Edge-stable equimatchable graphs
• 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
• A class of planar well‐covered graphs with girth four
• A classification of 1-well-covered graphs

This page was built for publication: 1-well-covered graphs containing a clique of size \(n/3\)

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