Hamiltonian paths in k-quasi-transitive digraphs
From MaRDI portal
Recommendations
Cites work
- 4-transitive digraphs. I: The structure of strong 4-transitive digraphs
- On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
- Quasi‐transitive digraphs
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- \(k\)-kings in \(k\)-quasitransitive digraphs
Cited in
(9)- k‐quasi‐transitive digraphs of large diameter
- Some results on (strong) total proper connection number of some digraphs
- Digraphs with proper connection number two
- Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
- Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter
- \(k\)-quasi-transitive digraphs of large diameter
- scientific article; zbMATH DE number 5831723 (Why is no real title available?)
- Quasi-transitive digraphs and their extensions
- Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter
This page was built for publication: Hamiltonian paths in \(k\)-quasi-transitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284740)