Pages that link to "Item:Q2442275"
From MaRDI portal
The following pages link to On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275):
Displaying 14 items.
- Expressive power of digraph solvability (Q409316) (← links)
- Some results on 4-transitive digraphs (Q503671) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- \(k\)-kernels in multipartite tournaments (Q656139) (← links)
- Even kernels (Q1346724) (← links)
- Combinatorial game theory foundations applied to digraph kernels (Q1378531) (← links)
- On the existence of 3- and 4-kernels in digraphs (Q1690223) (← links)
- Kernels in digraphs with covering number at most 3 (Q1861206) (← links)
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs (Q2330089) (← links)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Domination in Digraphs (Q3384119) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs (Q6044470) (← links)
