Antistrong digraphs (Q345072): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-disjoint spanning sub(di)graphs in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rooted-forest partition with uniform vertex demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Detachments of Graphs and Generalized Euler Trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank

Latest revision as of 00:38, 13 July 2024

scientific article
Language Label Description Also known as
English
Antistrong digraphs
scientific article

    Statements

    Antistrong digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    0 references
    antidirected path
    0 references
    bipartite representation
    0 references
    matroid
    0 references
    detachment
    0 references
    anticonnected digraph
    0 references
    0 references
    0 references