On F-independence in graphs

DOI10.7151/DMGT.1453MaRDI QIDQ3559385zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Some bounds on the size of maximum G-free sets in graphs
• On graphs with subgraphs having large independence numbers
• Maximum weighted induced subgraphs
• On the stability of the graph independence number
• Publication:3469129

Cited in

(21)

• Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
• Minimum \(k\)-path vertex cover
• The \(k\)-path vertex cover of rooted product graphs
• Partitions of graphs into small and large sets
• On the vertex \(k\)-path cover
• Maximum weighted induced subgraphs
• Augmenting approach for some maximum set problems
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
• Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
• On the weighted \(k\)-path vertex cover problem
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
• The weighted k-path vertex cover problem on series-parallel graphs
• 3-path vertex cover and dissociation number of hexagonal graphs
• A \(5k\)-vertex kernel for 3-path vertex cover
• A bound on the dissociation number
• Relating the independence number and the dissociation number
• Some bounds on the size of maximum G-free sets in graphs
• On computing the minimum 3-path vertex cover and dissociation number of graphs
• The characterization of the lower bound on the dissociation number of trees
• A sharp lower bound on the generalized 4-independence number
• Analyzing the 3-path vertex cover problem in selected graph classes

This page was built for publication: On \({\mathcal F}\)-independence in graphs

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