The following pages link to Fractional kernels in digraphs (Q1366601):
Displaying 14 items.
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Stable families of coalitions and normal hypergraphs (Q1277475) (← links)
- On a lemma of Scarf. (Q1403911) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Absorbant of generalized de Bruijn digraphs (Q2380030) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Kernels in weighted digraphs (Q2454043) (← links)
- A Polyhedral Description of Kernels (Q3186539) (← links)
- Gallai colorings and domination in multipartite digraphs (Q4650182) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- On kernel-less clique-acyclic orientations of minimally imperfect graphs (Q5954249) (← links)
