Independent trees in graphs

DOI10.1007/BF01202468MaRDI QIDQ1323489zbMATH OpenOpenAlexFDO

Authors Andreas Huck

Publication date 15 September 1994

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

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

zbMATH Keywords

directed graphsplanar graphsspanning trees

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• scientific article; zbMATH DE number 1953097
• Independent trees in planar graphs
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• On independent spanning trees

Cites work

• A Reduction Method for Edge-Connectivity in Graphs
• Depth-First Search and Linear Graph Algorithms
• Dividing a Graph into Triconnected Components
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• On independent spanning trees
• Paths in graphs, reducing the edge-connectivity only by two
• The multi-tree approach to reliability in distributed networks
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs

Cited in

(29)

• On independent spanning trees
• Independent trees in planar graphs
• Independent branchings in acyclic digraphs
• Spanning trees with pairwise nonadjacent endvertices
• Disjoint paths in arborescences
• An algorithm to construct independent spanning trees on parity cubes
• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Construction independent spanning trees on locally twisted cubes in parallel
• Independent spanning trees of chordal rings
• Connecting Vertices by Independent Trees
• Four edge-independent spanning trees
• Signpost systems and spanning trees of graphs
• An efficient parallel construction of optimal independent spanning trees on hypercubes
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• scientific article; zbMATH DE number 2080244 (Why is no real title available?)
• Completely independent spanning trees in torus networks
• scientific article; zbMATH DE number 1372667 (Why is no real title available?)
• Constructing node-independent spanning trees in augmented cubes
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees on even networks
• Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
• Independent spanning trees with small depths in iterated line digraphs
• Independent spanning trees in crossed cubes
• scientific article; zbMATH DE number 7742560 (Why is no real title available?)
• Completely independent spanning trees in line graphs
• \((t, s)\)-completely independent spanning trees
• Spanning trees: A survey
• Independent spanning trees on twisted cubes

This page was built for publication: Independent trees in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323489)