On F-independence in graphs

DOI10.7151/dmgt.1453zbMath1194.05116OpenAlexW2030600205MaRDI QIDQ3559385

Frank Göring, Dieter Rautenbach, Jochen Harant, Ingo Schiermeyer

Publication date: 14 May 2010

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

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

zbMATH Keywords

complexityindependenceprobabilistic method

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (16)

Augmenting approach for some maximum set problems ⋮ Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs ⋮ Unnamed Item ⋮ A \(5k\)-vertex kernel for 3-path vertex cover ⋮ A bound on the dissociation number ⋮ On the weighted \(k\)-path vertex cover problem ⋮ Relating the independence number and the dissociation number ⋮ On computing the minimum 3-path vertex cover and dissociation number of graphs ⋮ Partitions of graphs into small and large sets ⋮ On the vertex \(k\)-path cover ⋮ Kernelization and Parameterized Algorithms for 3-Path Vertex Cover ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems ⋮ Minimum \(k\)-path vertex cover ⋮ 3-path vertex cover and dissociation number of hexagonal graphs ⋮ The \(k\)-path vertex cover of rooted product graphs

This page was built for publication: On F-independence in graphs