Hamiltonian paths in k-quasi-transitive digraphs
From MaRDI portal
Publication:284740
DOI10.1016/J.DISC.2016.02.020zbMATH Open1336.05083OpenAlexW2344244064MaRDI QIDQ284740FDOQ284740
Authors: Ruixia Wang, Hui Zhang 
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
Recommendations
- 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
- \(k\)-quasi-transitive digraphs of large diameter
- scientific article; zbMATH DE number 731861
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
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
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
- Quasi‐transitive digraphs
- \(k\)-kings in \(k\)-quasitransitive digraphs
Cited In (9)
- Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
- Title not available (Why is that?)
- Quasi-transitive digraphs and their extensions
- Some results on (strong) total proper connection number of some digraphs
- Digraphs with proper connection number two
- \(k\)-quasi-transitive digraphs of large diameter
- Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter
- Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter
- k‐quasi‐transitive digraphs of 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)
