Parameterizing cut sets in a graph by the number of their components

DOI10.1007/978-3-642-10631-6_62zbMATH Open1272.05202OpenAlexW1556263447MaRDI QIDQ3652247FDOQ3652247

Marcin Kamiński, Takehiro Ito, Dimitrios M. Thilikos, Daniël Paulusma

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_62

Recommendations

• Parameterizing cut sets in a graph by the number of their components
• Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
• Minimal disconnected cuts in planar graphs
• Minimal disconnected cuts in planar graphs
• Parameterized graph separation problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cited In (7)

• On the Parameterized Complexity of Cutting a Few Vertices from a Graph
• The complexity of surjective homomorphism problems-a survey
• Reconstructing graphs from cut-set sizes
• Parameterizing cut sets in a graph by the number of their components
• Title not available (Why is that?)
• On disconnected cuts and separators
• Title not available (Why is that?)

This page was built for publication: Parameterizing cut sets in a graph by the number of their components

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