Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs

DOI10.1016/j.dam.2024.08.020MaRDI QIDQ6648248

Xiao Dong Chen, Limning Xiong, Guifu Su, Jiayuan Zhang

Publication date: 4 December 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

claw-free graphseligible vertextwo CISTsRyjáček's closure

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Ore's condition for completely independent spanning trees
• The multi-tree approach to reliability in distributed networks
• Forbidden subgraphs and Hamiltonian properties and graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• 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
• Two completely independent spanning trees of claw-free graphs
• Two completely independent spanning trees of \(P_4\)-free graphs
• Dirac's Condition for Completely Independent Spanning Trees
• 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
• Two completely independent spanning trees of split graphs
• Completely independent spanning trees in line graphs

This page was built for publication: Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs