Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138): Difference between revisions

@@ Property / author @@
-Benoit Darties
@@ Property / author: Benoit Darties / rank @@
-Normal rank
@@ Property / author @@
+Benoit Darties
@@ Property / author: Benoit Darties / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2594655405
@@ Property / OpenAlex ID: W2594655405 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08289
@@ Property / arXiv ID: 1702.08289 / rank @@
+Normal rank
@@ Property / cites work @@
+Dirac's Condition for Completely Independent Spanning Trees
+Normal rank
@@ Property / cites work @@
+On edge-disjoint spanning trees in hypercubes
@@ Property / cites work: On edge-disjoint spanning trees in hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Multicast in wormhole-switched torus networks using edge-disjoint spanning trees.
+Normal rank
@@ Property / cites work @@
+Constructing completely independent spanning trees in crossed cubes
+Normal rank
@@ Property / cites work @@
+Ore's condition for completely independent spanning trees
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem.
+Normal rank
@@ Property / cites work @@
+Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Connected Domatic Number in Planar Graphs
@@ Property / cites work: Connected Domatic Number in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Completely independent spanning trees in the underlying graph of a line digraph
+Normal rank
@@ Property / cites work @@
+Q4414501
@@ Property / cites work: Q4414501 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
+Normal rank
@@ Property / cites work @@
+Completely independent spanning trees in torus networks
+Normal rank
@@ Property / cites work @@
+Independent spanning trees with small depths in iterated line digraphs
+Normal rank
@@ Property / cites work @@
+Q3340900
@@ Property / cites work: Q3340900 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree condition for completely independent spanning trees
+Normal rank
@@ Property / cites work @@
+Independent spanning trees of chordal rings
@@ Property / cites work: Independent spanning trees of chordal rings / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+Q3581682
@@ Property / cites work: Q3581682 / rank @@
+Normal rank
@@ Property / cites work @@
+Completely independent spanning trees in (partial) \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Constructing two completely independent spanning trees in hypercube-variant networks
+Normal rank
@@ Property / cites work @@
+Two counterexamples on completely independent spanning trees
+Normal rank
@@ Property / cites work @@
+Q3027055
@@ Property / cites work: Q3027055 / rank @@
+Normal rank