Orientations of Hamiltonian cycles in bipartite digraphs
From MaRDI portal
(Redirected from Publication:1337013)
Let \(D= (X,Y,A)\) be a bipartite balanced digraph with node sets \(X\), \(Y\); \(| X|= | Y|= n\) and with arc set \(A\) fulfilling \(| A|\geq 2n^ 2- 2n+3\). Then the authors prove that \(D\) contains an almost Hamiltonian cycle unless \(D\) has a vertex which is not incident to any symmetric arc of \(D\). The authors compare their result with the actual literature.
Recommendations
- scientific article; zbMATH DE number 426372
- Arbitrary orientations of Hamilton cycles in digraphs
- Orientations of hamiltonian cycles in large digraphs
- Oriented hamilton cycles in digraphs
- Arbitrary orientations of Hamilton cycles in oriented graphs
- scientific article; zbMATH DE number 1047732
- Hamilton Cycles in Oriented Graphs
- scientific article; zbMATH DE number 5931607
- Hamiltonian cycles in bipartite graphs
- scientific article; zbMATH DE number 11998
Cites work
Cited in
(9)- A note on a question of C. D. Savage
- scientific article; zbMATH DE number 426372 (Why is no real title available?)
- scientific article; zbMATH DE number 4177106 (Why is no real title available?)
- Orientations of hamiltonian cycles in large digraphs
- Oriented hamilton cycles in digraphs
- Some results on the existence of Hamiltonian cycles in \(\mathcal{P} \)-compositions of bipartite digraphs
- Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
- Oriented discrepancy of Hamilton cycles
- Almost symmetric cycles in large digraphs
This page was built for publication: Orientations of Hamiltonian cycles in bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337013)