Completely independent spanning trees in line graphs

DOI10.1007/s00373-023-02688-yzbMath1519.05048arXiv2209.09565OpenAlexW4385493656MaRDI QIDQ6133659

Toru Hasunuma

Publication date: 21 August 2023

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

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

zbMATH Keywords

connectivitycomplete graphsline graphscompletely independent spanning trees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Ore's condition for completely independent spanning trees
• Two counterexamples on completely independent spanning trees
• Spanning trees: A survey
• Edge-connectivity and edge-disjoint spanning trees
• On computing a conditional edge-connectivity of a graph
• Independent trees in planar graphs
• Independent trees in graphs
• Packing spanning trees in highly essentially connected graphs
• Structural properties of subdivided-line graphs
• Constructing dual-CISTs of folded divide-and-swap cubes
• Note on the connectivity of line graphs
• Degree condition for completely independent spanning trees
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Dirac's Condition for Completely Independent Spanning Trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Completely independent spanning trees in torus networks
• Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks
• Finding Four Independent Trees
• Completely independent spanning trees in the underlying graph of a line digraph