A combinatorial problem in logic

DOI10.1016/0012-365X(77)90018-8MaRDI QIDQ1235721zbMATH OpenFDO

Authors A. Ramachandra Rao, C. Berge

Publication date 1977

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Categoricity and completeness of theories (03C35) Graph theory (05C99)

Cited in

(10)

• Counting kernels in directed graphs with arbitrary orientations
• A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Recent problems and results about kernels in directed graphs
• Combinatorial games on a graph
• (k,l)-kernels in line digraphs
• Locally Semicomplete Digraphs and Generalizations
• Unions of digraphs which become kernel perfect
• Kernels and partial line digraphs

This page was built for publication: A combinatorial problem in logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1235721)