Stable sets for (P_{6}, K_{2,3})-free graphs

DOI10.7151/dmgt.1598zbMath1257.05120OpenAlexW2400813871MaRDI QIDQ4648774

Raffaele Mosca

Publication date: 16 November 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1598

zbMATH Keywords

graph algorithmsstable sets\(P_6\)-free graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

One-three join: a graph operation and its consequences ⋮ Augmenting approach for some maximum set problems ⋮ Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ Connected vertex cover for \((sP_1+P_5)\)-free graphs ⋮ On cycle transversals and their connected variants in the absence of a small linear forest ⋮ Extending the MAX algorithm for maximum independent set ⋮ New sufficient conditions for \(\alpha\)-redundant vertices

This page was built for publication: Stable sets for (P_{6}, K_{2,3})-free graphs