Independent branchings in acyclic digraphs (Q1297456): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of a conjecture about independent branchings in <i>k</i>‐connected directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint paths and edge-disjoint branchings in directed graphs / rank
 
Normal rank

Latest revision as of 21:33, 28 May 2024

scientific article
Language Label Description Also known as
English
Independent branchings in acyclic digraphs
scientific article

    Statements

    Independent branchings in acyclic digraphs (English)
    0 references
    0 references
    9 August 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    branchings
    0 references
    acyclic digraphs
    0 references
    spanning trees
    0 references
    paths
    0 references