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

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

Latest revision as of 23:10, 14 July 2024

scientific article
Language Label Description Also known as
English
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
scientific article

    Statements

    Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2018
    0 references
    0 references
    spanning trees
    0 references
    independent spanning trees
    0 references
    disjoint connected dominating sets
    0 references
    completely independent spanning trees
    0 references
    grid
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references