Two completely independent spanning trees of split graphs

DOI10.1016/j.dam.2023.07.001zbMath1521.05092MaRDI QIDQ6094714

No author found.

Publication date: 14 September 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

split graphtoughnesstwo CISTs

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Ore's condition for completely independent spanning trees
• Toughness, hamiltonicity and split graphs
• New comments on ``A Hamilton sufficient condition for completely independent spanning tree
• Completely independent spanning trees in torus networks
• Completely independent spanning trees in the underlying graph of a line digraph
• Independent spanning trees with small depths in iterated line digraphs