A combinatorial problem in logic
From MaRDI portal
Publication:1235721
DOI10.1016/0012-365X(77)90018-8zbMath0352.05047MaRDI QIDQ1235721
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Categoricity and completeness of theories (03C35)
Related Items (9)
A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ Recent problems and results about kernels in directed graphs ⋮ Combinatorial games on a graph ⋮ Unions of digraphs which become kernel perfect ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Kernels and partial line digraphs ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ (k,l)-kernels in line digraphs
Cites Work
This page was built for publication: A combinatorial problem in logic
