Long paths and cycles in oriented graphs
From MaRDI portal
Publication:3907598
DOI10.1002/jgt.3190050204zbMath0458.05041OpenAlexW2083864191MaRDI QIDQ3907598
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050204
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (29)
Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ On cycles through a given vertex in multipartite tournaments ⋮ Hamilton Cycles in Oriented Graphs ⋮ Long cycles in bipartite tournaments ⋮ The robust component structure of dense regular graphs and applications ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Antipaths in oriented graphs ⋮ A sufficient condition for Hamiltonian cycles in bipartite tournaments ⋮ Cycles in bipartite tournaments ⋮ Hamilton decompositions of regular expanders: applications ⋮ Longest paths in bipartite digraphs ⋮ Longest paths in digraphs ⋮ Pancyclic out-arcs of a vertex in oriented graphs ⋮ Subtrees of bipartite digraphs---the minimum degree condition ⋮ Powers of Hamilton cycles in tournaments ⋮ Cycles and paths of many lengths in bipartite digraphs ⋮ Maximal sets of Hamilton cycles in \(D_n\) ⋮ The structure of 2-colored best match graphs ⋮ Multipartite tournaments: a survey ⋮ Vertex-disjoint cycles in bipartite tournaments ⋮ Unnamed Item ⋮ On degree sum conditions for directed path-factors with a specified number of paths ⋮ Design of test inputs and their sequences in multi-function system testing ⋮ Every cycle-connected multipartite tournament has a universal arc ⋮ Cycles and paths in bipartite tournaments with spanning configurations ⋮ An approximate version of Jackson’s conjecture ⋮ Tournaments and Semicomplete Digraphs ⋮ Semicomplete Multipartite Digraphs
This page was built for publication: Long paths and cycles in oriented graphs