Two completely independent spanning trees of claw-free graphs

DOI10.1016/J.DISC.2022.113080MaRDI QIDQ2675841zbMATH OpenOpenAlexFDO

Authors Xiaodong Chen, Mingchu Li, Liming Xiong

Publication date 26 September 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2022.113080

zbMATH Keywords

claw-free graphseligible vertextwo CISTs

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Recommendations

• Two completely independent spanning trees of P₄-free graphs
• A Hamilton sufficient condition for completely independent spanning tree
• Two completely independent spanning trees of split 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
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• Independent spanning trees with small depths in iterated line digraphs
• New comments on ``A Hamilton sufficient condition for completely independent spanning tree
• On a closure concept in claw-free graphs
• Ore's condition for completely independent spanning trees
• The multi-tree approach to reliability in distributed networks

Cited in

(6)

• Two completely independent spanning trees of P₄-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
• 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

This page was built for publication: Two completely independent spanning trees of claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675841)