Ore's condition for completely independent spanning trees
From MaRDI portal
(Redirected from Publication:406328)
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
- Completely independent spanning trees in the underlying graph of a line digraph
- Completely independent spanning trees in torus networks
- Dirac's condition for completely independent spanning trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- scientific article; zbMATH DE number 1953097 (Why is no real title available?)
- Independent spanning trees with small depths in iterated line digraphs
- Note on Hamilton Circuits
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
- Some Theorems on Abstract Graphs
- The square of every two-connected graph is Hamiltonian
- Two counterexamples on completely independent spanning trees
Cited in
(34)- Improving the diameters of completely independent spanning trees in locally twisted cubes
- Completely independent spanning trees in k-th power of graphs
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Complete family reduction and spanning connectivity in line graphs
- Degree conditions for completely independent spanning trees of bipartite 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
- Reliability analysis based on the dual-CIST in shuffle-cubes
- A well-equalized 3-CIST partition of alternating group graphs
- Constructing dual-CISTs of DCell data center networks
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Degree condition for completely independent spanning trees
- Two completely independent spanning trees of claw-free graphs
- Two completely independent spanning trees of P₄-free graphs
- Constructing two completely independent spanning trees in hypercube-variant networks
- Constructing completely independent spanning trees in crossed cubes
- Completely independent spanning trees in some regular graphs
- Constructing tri-CISTs in shuffle-cubes
- Two completely independent spanning trees of split graphs
- Completely independent spanning trees in line graphs
- Dirac's condition for completely independent spanning trees
- Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- The existence condition of k completely independent spanning tree for some graphs
- A sufficient condition for the existence of two completely independent spanning trees
- A note on the 4-connected line graph of a planar triangulation containing two CISTs
- Fan-type condition for two completely independent spanning trees
- An innovative algorithm for generating three completely independent spanning trees in folded hypercube networks
- The completely independent spanning trees in P₄-free graphs
- Completely independent spanning trees in kth power of 2-connected graphs
- Completely independent spanning trees in split graphs
- Completely independent spanning trees in split graphs: structural properties and complexity
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)
