Skip to main content
SpringerLink
Log in

Independent Trees in Planar Graphs Independent trees

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 We prove the following statement: Let G be a finite k-connected undirected planar graph and s be a vertex of G. Then there exist k spanning trees T 1,…,T k in G such that for each vertex x≠s of G, the k paths from x to s in T 1,…,T k are pairwise openly disjoint.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Hannover, Welfengarten 1, 30167 Hannover, Germany. e-mail: huck@math.uni-hannover.de, , , , , , DE

    Andreas Huck

Authors
  1. Andreas Huck
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: September 1, 1994 Revised: September 4, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huck, A. Independent Trees in Planar Graphs Independent trees. Graphs Comb 15, 29–77 (1999). https://doi.org/10.1007/PL00021190

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00021190

Keywords

Search

Navigation