Ore's condition for completely independent spanning trees

DOI10.1016/j.dam.2014.06.002zbMath1300.05060OpenAlexW1963897549MaRDI QIDQ406328

Yanmei Hong, Qinghai Liu, Geng-Hua Fan

Publication date: 8 September 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.002

zbMATH Keywords

line graphscompletely independent spanning treesCIST

Mathematics Subject Classification ID

Trees (05C05) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Improving the diameters of completely independent spanning trees in locally twisted cubes, Degree condition for completely independent spanning trees, Completely independent spanning trees in \(k\)-th power of graphs, Constructing two completely independent spanning trees in hypercube-variant networks, A Hamilton sufficient condition for completely independent spanning tree, Two completely independent spanning trees of claw-free graphs, Two completely independent spanning trees of split graphs, Comments on: ``A Hamilton sufficient condition for completely independent spanning tree, Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees, Completely independent spanning trees in line graphs, Two completely independent spanning trees of \(P_4\)-free graphs, New comments on ``A Hamilton sufficient condition for completely independent spanning tree, Constructing completely independent spanning trees in crossed cubes, Reliability analysis based on the dual-CIST in shuffle-cubes, Completely independent spanning trees in some regular graphs, A well-equalized 3-CIST partition of alternating group graphs, Constructing dual-CISTs of DCell data center networks, Constructing tri-CISTs in shuffle-cubes, Three completely independent spanning trees of crossed cubes with application to secure-protection routing, A two-stages tree-searching algorithm for finding three completely independent spanning trees, Degree conditions for completely independent spanning trees of bipartite graphs

Cites Work

• Unnamed Item
• Two counterexamples on completely independent spanning trees
• On hamiltonian line graphs and connectivity
• The square of every two-connected graph is Hamiltonian
• Dirac's Condition for Completely Independent Spanning Trees
• Note on Hamilton Circuits
• Edge-Disjoint Spanning Trees of Finite Graphs
• Completely independent spanning trees in torus networks
• Reflections on graph theory
• Some Theorems on Abstract Graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Independent spanning trees with small depths in iterated line digraphs