On digraphs with no two disjoint directed cycles (Q1092919): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles possible in digraphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results Concerning the Structure of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent circuits of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-linkage problem for acyclic digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:47, 18 June 2024

scientific article
Language Label Description Also known as
English
On digraphs with no two disjoint directed cycles
scientific article

    Statements

    On digraphs with no two disjoint directed cycles (English)
    0 references
    0 references
    1987
    0 references
    configurations
    0 references
    2-connected digraphs
    0 references
    algorithm
    0 references
    disjoint dicycles
    0 references
    NP- complete
    0 references

    Identifiers