Completely independent spanning trees in \(k\)-th power of graphs

DOI10.7151/dmgt.2038zbMath1391.05080OpenAlexW2792506579MaRDI QIDQ1649915

Xia Hong

Publication date: 29 June 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2038

zbMATH Keywords

spanning treespower of graphscompletely independent spanning tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items (2)

A Hamilton sufficient condition for completely independent spanning tree ⋮ Degree conditions for completely independent spanning trees of bipartite graphs

Cites Work

• Unnamed Item
• Ore's condition for completely independent spanning trees
• Two counterexamples on completely independent spanning trees
• Homeomorphically irreducible spanning trees
• Degree condition 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 the underlying graph of a line digraph

This page was built for publication: Completely independent spanning trees in \(k\)-th power of graphs