Independent trees in planar graphs

DOI10.1007/s003730050041zbMath0924.05019OpenAlexW2043310936MaRDI QIDQ1288514

Andreas Huck

Publication date: 11 May 1999

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050041

zbMATH Keywords

pathsspanning trees\(k\)-connected planar graphopenly disjoint

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Construction independent spanning trees on locally twisted cubes in parallel, Constructing edge-disjoint spanning trees in twisted cubes, An efficient parallel construction of optimal independent spanning trees on hypercubes, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, An algorithm to construct independent spanning trees on parity cubes, Completely independent spanning trees in line graphs, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Independent spanning trees on twisted cubes, Construction of optimal independent spanning trees on folded hypercubes, The generalized 4-connectivity of hypercubes, Completely independent spanning trees in torus networks, Edge-independent spanning trees in augmented cubes, Constructing independent spanning trees for locally twisted cubes, Independent spanning trees on even networks, Independent spanning trees with small depths in iterated line digraphs, Structural properties of subdivided-line graphs, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Independent spanning trees on folded hyper-stars, Constructing edge-disjoint spanning trees in locally twisted cubes, An improved algorithm to construct edge-independent spanning trees in augmented cubes, Mondshein Sequences (a.k.a. (2,1)-Orders), Constructing Node-Independent Spanning Trees in Augmented Cubes, A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks, Independent spanning trees in crossed cubes