On Almost Well-Covered Graphs of Girth at Least 6

zbMath1401.05232arXiv1708.04632MaRDI QIDQ4560269

Ademir Hujdurović, Didem Gözüpek, Tınaz Ekim, Martin Milanič

Publication date: 10 December 2018

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

zbMATH Keywords

girthmaximal independent setalmost well-covered graphindependence gap

Mathematics Subject Classification ID

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

\((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Mind the independence gap

This page was built for publication: On Almost Well-Covered Graphs of Girth at Least 6