Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A degree sum condition for Hamiltonicity in balanced bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for cycles of maximum length in bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Meyniel condition for hamiltonicity in bipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths of many lengths in bipartite digraphs / 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: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Meyniel's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for the hamiltonian property of digraphs with large semi-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for a balanced bipartite digraph to be even pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and paths in bipartite tournaments with spanning configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Hamilton cycles in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for maximum cycles in bipartite 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: Q5591387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long Cycles in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a balanced bipartite digraph to be hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank

Latest revision as of 21:43, 18 July 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
scientific article

    Statements

    Sufficient conditions for Hamiltonian cycles in bipartite digraphs (English)
    0 references
    22 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian cycles
    0 references
    bipartite digraphs
    0 references
    perfect matching
    0 references
    longest non-Hamiltonian cycles
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references