The following pages link to (Q4293774):
Displaying 4 items.
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs (Q2330089) (← links)
- On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275) (← links)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)