Two completely independent spanning trees of split graphs
From MaRDI portal
Publication:6094714
Recommendations
- A Hamilton sufficient condition for completely independent spanning tree
- Two completely independent spanning trees of P₄-free graphs
- Two completely independent spanning trees of claw-free graphs
- Ore's condition for completely independent spanning trees
- Dirac's condition 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
- 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
- Ore's condition for completely independent spanning trees
- Toughness, hamiltonicity and split graphs
Cited in
(11)- Two completely independent spanning trees of claw-free graphs
- Two completely independent spanning trees of P₄-free graphs
- Completely independent spanning trees in some regular graphs
- Independent spanning trees on even networks
- Completely independent spanning trees in the underlying graph of a line digraph
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- 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
- 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: Two completely independent spanning trees of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094714)
