Combinatorial game theory foundations applied to digraph kernels

zbMath0884.05045MaRDI QIDQ1378531

Aviezri S. Fraenkel

Publication date: 15 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119216

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

On variants of vertex geography on undirected graphs, H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs., Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3, Kernels in digraphs that are not kernel perfect, On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs, Kernels by monochromatic paths in digraphs with covering number 2, Kernels in planar digraphs, On the existence of \((k,l)\)-kernels in infinite digraphs: a survey, Indepth combinatorial analysis of admissible sets for abstract argumentation