Degree conditions for completely independent spanning trees of bipartite graphs

DOI10.1007/s00373-022-02585-wzbMath1502.05034OpenAlexW4307649332MaRDI QIDQ2093107

Aixia Liu, Jun Yuan, Ru Zhang

Publication date: 4 November 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-022-02585-w

zbMATH Keywords

bipartite graphsminimum degreespanning treescompletely independent spanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ore's condition for completely independent spanning trees
• Two counterexamples on completely independent spanning trees
• Constructing completely independent spanning trees in crossed cubes
• Completely independent spanning trees in some regular graphs
• The multi-tree approach to reliability in distributed networks
• Completely independent spanning trees in \(k\)-th power of graphs
• A Hamilton sufficient condition for completely independent spanning tree
• Comments on: ``A Hamilton sufficient condition for completely independent spanning tree
• New comments on ``A Hamilton sufficient condition for completely independent spanning tree
• Completely independent spanning trees in (partial) \(k\)-trees
• Degree condition for completely independent spanning trees
• Completely independent spanning trees in torus networks
• Completely independent spanning trees in the underlying graph of a line digraph

This page was built for publication: Degree conditions for completely independent spanning trees of bipartite graphs