Combinatorial game theory foundations applied to digraph kernels
From MaRDI portal
Recommendations
Cited in
(18)- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
- Kernels in planar digraphs
- Inductive kernels of graphs
- Kernels by monochromatic paths in digraphs with covering number 2
- Counting kernels in directed graphs with arbitrary orientations
- Kernels in directed graphs: A poison game
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
- On variants of vertex geography on undirected graphs
- Choices and kernels in bipolar valued digraphs
- Expressive power of digraph solvability
- scientific article; zbMATH DE number 3865312 (Why is no real title available?)
- Kernels in digraphs that are not kernel perfect
- scientific article; zbMATH DE number 3891402 (Why is no real title available?)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- A framework for data mining on combinatorial game theory
- Even kernels
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
This page was built for publication: Combinatorial game theory foundations applied to digraph kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378531)