Four Edge-Independent Spanning Trees

DOI10.1137/17M1134056zbMath1386.05028arXiv1705.01199MaRDI QIDQ3130452

Robin Thomas, Alexander Hoyer

Publication date: 22 January 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.01199

zbMATH Keywords

graph theoryedge-connectivityrooted treesgraph decompositionsstructural graph theoryedge-independent trees

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (4)

Edge-orders ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ 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

Cites Work

• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• On independent spanning trees
• Independent trees in graphs
• Non-separating paths in 4-connected graphs
• A counterexample for the proof of implication conjecture on independent spanning trees
• Three tree-paths
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Finding Four Independent Trees
• Chain Decompositions of 4-Connected Graphs

This page was built for publication: Four Edge-Independent Spanning Trees