Traceability of \(k\)-traceable oriented graphs (Q965994): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2009.12.022 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Longest path partitions in generalizations of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite strongly connected digraph of stability 2 has a Hamiltonian path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets and non-augmentable paths in generalizations of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets which meet all longest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypotraceable digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable set meeting every longest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed path partition conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A traceability conjecture for oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105538 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2009.12.022 / rank
 
Normal rank

Latest revision as of 10:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Traceability of \(k\)-traceable oriented graphs
scientific article

    Statements

    Traceability of \(k\)-traceable oriented graphs (English)
    0 references
    0 references
    27 April 2010
    0 references
    oriented graph
    0 references
    generalized tournament
    0 references
    traceable
    0 references
    hypotraceable
    0 references
    \(k\)-traceable
    0 references
    traceability conjecture
    0 references
    longest path
    0 references

    Identifiers