Hamiltonian paths in \(k\)-quasi-transitive digraphs
From MaRDI portal
Publication:284740
DOI10.1016/j.disc.2016.02.020zbMath1336.05083OpenAlexW2344244064MaRDI QIDQ284740
Publication date: 18 May 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.020
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
\(k\)-quasi-transitive digraphs of large diameter ⋮ k‐quasi‐transitive digraphs of large diameter ⋮ Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Digraphs with proper connection number two ⋮ Quasi-Transitive Digraphs and Their Extensions
Cites Work
- On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
- 4-transitive digraphs I: the structure of strong 4-transitive digraphs
- Quasi‐transitive digraphs
- k‐Kings in k‐Quasitransitive Digraphs
This page was built for publication: Hamiltonian paths in \(k\)-quasi-transitive digraphs