Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete T-partite graph

MaRDI QIDQ6568982zbMATH OpenFDO

Authors Xia Hong, Feng Gao, Zeng-bao Wu

Publication date 8 July 2024

Published in Contributions to Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimal graphscompletely independent spanning treecompletet-partite graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• Degree condition for completely independent spanning trees
• Completely independent spanning trees in some regular graphs
• Completely independent spanning trees in (partial) \(k\)-trees
• Degree conditions for completely independent spanning trees of bipartite graphs
• Completely independent spanning trees in \(k\)-th power of graphs

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• A Hamilton sufficient condition for completely independent spanning tree
• Completely independent spanning trees in (partial) \(k\)-trees
• Completely independent spanning trees in \(k\)-th power of graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in torus networks
• Degree condition for completely independent spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Ore's condition for completely independent spanning trees
• Two counterexamples on completely independent spanning trees

This page was built for publication: Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph

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