(t, s)-completely independent spanning trees

DOI10.1007/978-981-97-0566-5_26MaRDI QIDQ6575408zbMATH OpenFDO

Authors Shin-Ichi Nakano

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_26

zbMATH Keywords

independent spanning treesspanning tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Drawing planar graphs using the canonical ordering
• Efficient Planarity Testing
• Finding Four Independent Trees
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• scientific article; zbMATH DE number 1696542 (Why is no real title available?)
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• scientific article; zbMATH DE number 1262807 (Why is no real title available?)
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• Independent trees in graphs
• Independent trees in planar graphs
• On independent spanning trees
• Output-sensitive reporting of disjoint paths
• The multi-tree approach to reliability in distributed networks
• Three tree-paths

This page was built for publication: \((t, s)\)-completely independent spanning trees

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