Independent trees in planar graphs
From MaRDI portal
Publication:1288514
DOI10.1007/s003730050041zbMath0924.05019MaRDI QIDQ1288514
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
05C05: Trees
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Completely independent spanning trees in torus networks, Constructing Node-Independent Spanning Trees in Augmented Cubes, Independent spanning trees with small depths in iterated line digraphs, Independent spanning trees in crossed cubes, Completely independent spanning trees in line graphs, An efficient parallel construction of optimal independent spanning trees on hypercubes, Construction of optimal independent spanning trees on folded hypercubes, The generalized 4-connectivity of hypercubes, Edge-independent spanning trees in augmented cubes, Constructing independent spanning trees for locally twisted cubes, Independent spanning trees on even networks, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Independent spanning trees on twisted cubes, Constructing edge-disjoint spanning trees in locally twisted cubes, An algorithm to construct independent spanning trees on parity cubes, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Structural properties of subdivided-line graphs, A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, An improved algorithm to construct edge-independent spanning trees in augmented cubes, Construction independent spanning trees on locally twisted cubes in parallel, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, Constructing edge-disjoint spanning trees in twisted cubes, Mondshein Sequences (a.k.a. (2,1)-Orders), Independent spanning trees on folded hyper-stars
