On Partitioning a Graph into Two Connected Subgraphs

DOI10.1007/978-3-642-10631-6_122zbMath1272.05205OpenAlexW1858400442MaRDI QIDQ3652306

Johan M. M. van Rooij, 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_122

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

Removing local extrema from imprecise terrains

This page was built for publication: On Partitioning a Graph into Two Connected Subgraphs