Ore's condition for completely independent spanning trees
From MaRDI portal
Publication:406328
DOI10.1016/J.DAM.2014.06.002zbMATH Open1300.05060OpenAlexW1963897549MaRDI QIDQ406328FDOQ406328
Yanmei Hong, Genghua Fan, Qinghai Liu
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.002
Recommendations
- Degree condition for completely independent spanning trees
- Dirac's condition for completely independent spanning trees
- The independence number condition for the existence of a spanning \(f\)-tree
- scientific article; zbMATH DE number 434863
- A Hamilton sufficient condition for completely independent spanning tree
- Completely independent spanning trees in (partial) \(k\)-trees
- On independent spanning trees
- Completely independent spanning trees in some regular graphs
- Degree conditions for completely independent spanning trees of bipartite graphs
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
Cites Work
- Note on Hamilton Circuits
- Edge-Disjoint Spanning Trees of Finite Graphs
- Some Theorems on Abstract Graphs
- The square of every two-connected graph is Hamiltonian
- Reflections on graph theory
- On hamiltonian line graphs and connectivity
- Dirac's Condition for Completely Independent Spanning Trees
- Two counterexamples on completely independent spanning trees
- Title not available (Why is that?)
- 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
Cited In (23)
- New comments on ``A Hamilton sufficient condition for completely independent spanning tree
- Two completely independent spanning trees of split graphs
- Completely independent spanning trees in line graphs
- Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph
- Completely independent spanning trees in some regular graphs
- Completely independent spanning trees in \(k\)-th power of graphs
- Comments on: ``A Hamilton sufficient condition for completely independent spanning tree
- Degree conditions for completely independent spanning trees of bipartite graphs
- A Hamilton sufficient condition for completely independent spanning tree
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- Constructing dual-CISTs of DCell data center networks
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Constructing two completely independent spanning trees in hypercube-variant networks
- A well-equalized 3-CIST partition of alternating group graphs
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Constructing tri-CISTs in shuffle-cubes
- Degree condition for completely independent spanning trees
- Constructing completely independent spanning trees in crossed cubes
- Two completely independent spanning trees of claw-free graphs
- Two completely independent spanning trees of \(P_4\)-free graphs
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
- Reliability analysis based on the dual-CIST in shuffle-cubes
This page was built for publication: Ore's condition for completely independent spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406328)
