Two completely independent spanning trees of P₄-free graphs

DOI10.1007/S00373-023-02622-2MaRDI QIDQ2698533OpenAlexFDO

Authors Jingjing Li, Fuliang Lu, Xiaodong Chen

Publication date 24 April 2023

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-023-02622-2

zbMATH Keywords

toughness\(P_4\)-free graphtwo CISTs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Two completely independent spanning trees of claw-free graphs
• Two completely independent spanning trees of split graphs
• A Hamilton sufficient condition for completely independent spanning tree
• Ore's condition for completely independent spanning trees
• scientific article; zbMATH DE number 1953097

Cites work

• Title not available (Why is no real title available?)
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in torus networks
• 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

(4)

• Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
• Two completely independent spanning trees of split graphs
• A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs
• Two completely independent spanning trees of claw-free 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)