Parameterizing Cut Sets in a Graph by the Number of Their Components

DOI10.1007/978-3-642-10631-6_62zbMath1272.05202OpenAlexW1556263447MaRDI QIDQ3652247

Marcin Kaminski, 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

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ The complexity of surjective homomorphism problems-a survey ⋮ Parameterizing cut sets in a graph by the number of their components ⋮ On disconnected cuts and separators

This page was built for publication: Parameterizing Cut Sets in a Graph by the Number of Their Components