Fractional kernels in digraphs

DOI10.1006/jctb.1997.1731zbMath0904.05036OpenAlexW2007990089MaRDI QIDQ1366601

Ron Aharoni, Ron Holzman

Publication date: 15 September 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/be3f4379c55b3ccf024efb07b50a1c1f04d28180

zbMATH Keywords

digraphperfect graphfractional kernel

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Absorbant of generalized de Bruijn digraphs ⋮ A Polyhedral Description of Kernels ⋮ Perfect graphs are kernel solvable ⋮ On a lemma of Scarf. ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Kernels in weighted digraphs ⋮ Gallai colorings and domination in multipartite digraphs ⋮ A note on kernels and Sperner's Lemma ⋮ A polyhedral approach to the stability of a family of coalitions ⋮ Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree ⋮ On kernel-less clique-acyclic orientations of minimally imperfect graphs ⋮ Perfect graphs with polynomially computable kernels ⋮ Stable families of coalitions and normal hypergraphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• Kernels in perfect line-graphs
• On kernels in i-triangulated graphs
• A characterization of perfect graphs
• The Core of an N Person Game
• College Admissions and the Stability of Marriage

This page was built for publication: Fractional kernels in digraphs