Two counterexamples on completely independent spanning trees

DOI10.1016/J.DISC.2011.11.015MaRDI QIDQ409435zbMATH OpenOpenAlexWikidataFDO

Authors Ferenc Péterfalvi

Publication date 13 April 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

interconnection networksplane graphsindependent spanning treesTutte graph

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 1953097
• Completely independent spanning trees in some regular graphs
• On completely independent spanning trees in powers of graphs
• Completely independent spanning trees in k-th power of graphs
• Completely independent spanning trees in (partial) \(k\)-trees

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• Completely independent spanning trees in the underlying graph of a line digraph
• Graph theory

Cited in

(31)

• New comments on ``A Hamilton sufficient condition for completely independent spanning tree
• Completely independent spanning trees in line graphs
• A counterexample to a result on the tree graph of a graph
• Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph
• A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
• Completely independent spanning trees in some regular graphs
• Completely independent spanning trees in k-th power of graphs
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
• Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
• Finding totally independent spanning trees with linear integer programming
• A counterexample for the proof of implication conjecture on independent spanning trees
• Comments on: ``A Hamilton sufficient condition for completely independent spanning tree
• Degree conditions for completely independent spanning trees of bipartite graphs
• A Hamilton sufficient condition for completely independent spanning tree
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• Constructing dual-CISTs of DCell data center networks
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• Constructing two completely independent spanning trees in hypercube-variant networks
• Ore's condition for completely independent spanning trees
• A well-equalized 3-CIST partition of alternating group graphs
• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Completely independent spanning trees in (partial) \(k\)-trees
• Constructing completely independent spanning trees in crossed cubes
• Degree condition for completely independent spanning trees
• Constructing tri-CISTs in shuffle-cubes
• Constructing tri-CISTs in shuffle-cubes
• Dirac's condition for completely independent spanning trees
• Structural properties of subdivided-line graphs
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
• Reliability analysis based on the dual-CIST in shuffle-cubes

This page was built for publication: Two counterexamples on completely independent spanning trees

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