Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

DOI10.1007/978-3-319-29516-9_22zbMath1478.05022OpenAlexW2418021936MaRDI QIDQ2798238

Toru Hasunuma

Publication date: 4 April 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29516-9_22

zbMATH Keywords

Hamiltonian graphsymmetric regular graphs

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (15)

Improving the diameters of completely independent spanning trees in locally twisted cubes ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ Comments on: ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Completely independent spanning trees in line graphs ⋮ New comments on ``A Hamilton sufficient condition for completely independent spanning tree ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ Completely independent spanning trees in some regular graphs ⋮ A well-equalized 3-CIST partition of alternating group graphs ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)

This page was built for publication: Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees