(k + 1)-kernels and the number of k-kings in k-quasi-transitive digraphs
From MaRDI portal
(Redirected from Publication:468446)
\((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
\((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
Recommendations
Cites work
- 4-transitive digraphs. I: The structure of strong 4-transitive digraphs
- Kings in locally semicomplete digraphs
- Kings in multipartite tournaments
- Kings in quasi-transitive digraphs
- Kings in semicomplete multipartite digraphs
- Kings in strong tournaments.
- Number of 4-kings in bipartite tournaments with no 3-kings
- On the existence and number of (k+1)-kings in k-quasi-transitive digraphs
- On the structure of strong 3-quasi-transitive digraphs
- Perfect graphs, kernels, and cores of cooperative games
- k-kernels in k-transitive and k-quasi-transitive digraphs
- \(k\)-kernels in generalizations of transitive digraphs
- \(k\)-kings in \(k\)-quasitransitive digraphs
Cited in
(13)- On the number of quasi-kernels in digraphs
- k‐quasi‐transitive digraphs of large diameter
- Hamiltonian paths in \(k\)-quasi-transitive digraphs
- Quasi-transitive digraphs and their extensions
- On the existence and number of (k+1)-kings in k-quasi-transitive digraphs
- k-kernels in k-transitive and k-quasi-transitive digraphs
- Kings in quasi-transitive digraphs
- On the kings and kings-of-kings in semicomplete multipartite digraphs
- \(k\)-kings in \(k\)-quasitransitive digraphs
- On the existence of 3- and 4-kernels in digraphs
- \(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
This page was built for publication: \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468446)