A note on some embedding problems for oriented graphs (Q2891043): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Powers of Hamilton cycles in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of large combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles in Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact minimum degree condition for Hamilton cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle packings and 1-factors in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of a conjecture of Erdös and moser on tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tournaments and their largest transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tournaments free of large transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling transitive tournaments and their blow-ups / rank
 
Normal rank

Latest revision as of 08:46, 5 July 2024

scientific article
Language Label Description Also known as
English
A note on some embedding problems for oriented graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references