Maximal k-independent sets in graphs

DOI10.7151/dmgt.1398zbMath1169.05030OpenAlexW2046906585MaRDI QIDQ3527533

Mustapha Chellali, Mostafa Blidia, Nacéra Meddah, Odile Favaron

Publication date: 29 September 2008

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

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

zbMATH Keywords

cactus\(k\)-independent

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Domination, independent domination and \(k\)-independence in trees ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Ratios of some domination parameters in trees ⋮ Brill-Noether conjecture on cactus graphs

This page was built for publication: Maximal k-independent sets in graphs