Fractional kernels in digraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- A note on kernels and Sperner's Lemma
- Perfect graphs are kernel solvable
- Stable families of coalitions and normal hypergraphs
- Gallai colorings and domination in multipartite digraphs
- A polyhedral approach to the stability of a family of coalitions
- Perfect graphs, kernels, and cores of cooperative games
- Absorbant of generalized de Bruijn digraphs
- scientific article; zbMATH DE number 5769858 (Why is no real title available?)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- On a lemma of Scarf.
- Perfect graphs with polynomially computable kernels
- Kernels in weighted digraphs
- A Polyhedral Description of Kernels
- On kernel-less clique-acyclic orientations of minimally imperfect graphs
This page was built for publication: Fractional kernels in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366601)