Connecting Terminals and 2-Disjoint Connected Subgraphs

DOI10.1007/978-3-642-45043-3_36zbMath1417.05112arXiv1301.2506MaRDI QIDQ2864321

Jan Arne Telle, Yngve Villanger

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.2506

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C40: Connectivity