Two completely independent spanning trees of P₄-free graphs
From MaRDI portal
(Redirected from Publication:2698533)
Two completely independent spanning trees of \(P 4\)-free graphs
Two completely independent spanning trees of \(P 4\)-free graphs
Recommendations
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
- Graph theory with applications
- Independent spanning trees with small depths in iterated line digraphs
- New comments on ``A Hamilton sufficient condition for completely independent spanning tree
- On a class of posets and the corresponding comparability graphs
- Ore's condition for completely independent spanning trees
- The multi-tree approach to reliability in distributed networks
Cited in
(9)- Two completely independent spanning trees of claw-free graphs
- A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs
- Two completely independent spanning trees of split graphs
- 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
- 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
This page was built for publication: Two completely independent spanning trees of \(P_4\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698533)
