Pages that link to "Item:Q1378531"
From MaRDI portal
The following pages link to Combinatorial game theory foundations applied to digraph kernels (Q1378531):
Displaying 16 items.
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Kernels in digraphs that are not kernel perfect (Q442354) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- Even kernels (Q1346724) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- Kernels in directed graphs: A poison game (Q1801706) (← links)
- Indepth combinatorial analysis of admissible sets for abstract argumentation (Q2107484) (← links)
- Choices and kernels in bipolar valued digraphs (Q2432842) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)
- A framework for data mining on combinatorial game theory (Q3181607) (← links)
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. (Q4986281) (← links)
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs (Q5154626) (← links)
- Counting kernels in directed graphs with arbitrary orientations (Q6559392) (← links)