k-kernels in multipartite tournaments
From MaRDI portal
Publication:656139
zbMATH Open1241.05042MaRDI QIDQ656139FDOQ656139
Authors: Hortensia Galeana-Sánchez, César Hernández-Cruz
Publication date: 26 January 2012
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Cited In (8)
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
- Title not available (Why is that?)
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
- On the complexity of the 3-kernel problem in some classes of digraphs
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- On the existence of 3- and 4-kernels in digraphs
- Title not available (Why is that?)
- Competitively orientable complete multipartite graphs
This page was built for publication: \(k\)-kernels in multipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656139)