The following pages link to A combinatorial problem in logic (Q1235721):
Displaying 10 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Kernels and partial line digraphs (Q990794) (← links)
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
- Combinatorial games on a graph (Q1916376) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Recent problems and results about kernels in directed graphs (Q2640613) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- (k,l)-kernels in line digraphs (Q3422545) (← links)
- Counting kernels in directed graphs with arbitrary orientations (Q6559392) (← links)
