On independent spanning trees

DOI10.1016/0020-0190(92)90230-SzbMath0770.05036MaRDI QIDQ1198088

Samir Khuller, Baruch Schieber

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

vertex connectivityspanning treesedge connectivity

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (11)

Independent spanning trees of chordal rings ⋮ Unnamed Item ⋮ A counterexample for the proof of implication conjecture on independent spanning trees ⋮ Spanning trees: A survey ⋮ Independent spanning trees on twisted cubes ⋮ Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS ⋮ Four Edge-Independent Spanning Trees ⋮ Independent trees in graphs

Cites Work

• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

This page was built for publication: On independent spanning trees