A survey on Hamilton cycles in directed graphs (Q412269): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1006.0590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for a digraph to be Hamiltonian / 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: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of Hamilton cycles in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of Hamiltonian paths in strong tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning vertices of a tournament into independent cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Semiexact Degree Condition for Hamilton Cycles in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamilton cycles in robustly expanding digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bollobás–Eldridge Conjecture for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles in Regular Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Hamiltonian Cycles in a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing Hamilton cycles in \(\varepsilon\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles in Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented hamilton cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian cycles in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in highly connected and expanding graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting flags in triangle-free digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in regular 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Chvátal-Erdős condition for Hamilton cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey / 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: Arbitrary orientations of Hamilton cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Result on Hamilton Cycles in Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of given length in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-ordered Hamiltonian 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: Sparse pseudo‐random graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Sumner's universal tournament conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Sumner's universal tournament conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree sequences in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-Ordered Hamilton cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary cycles of all lengths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and Cycles in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition implying a digraph to be pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some embedding problems for oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and computational aspects of graph packing and graph decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703923 / rank
 
Normal rank

Latest revision as of 04:01, 5 July 2024

scientific article
Language Label Description Also known as
English
A survey on Hamilton cycles in directed graphs
scientific article

    Statements

    A survey on Hamilton cycles in directed graphs (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    oriented graphs
    0 references
    tournaments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references