Kernels in weighted digraphs

DOI10.1007/S11083-013-9286-4zbMath1290.05080OpenAlexW2029682495MaRDI QIDQ2454043

Eli Berger, Irina Gorelik, Ron Aharoni

Publication date: 12 June 2014

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-013-9286-4

zbMATH Keywords

digraphkernelpartial order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

\((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem ⋮ On weighted kernels of two posets. ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture

Cites Work

• Unnamed Item
• Perfect graphs are kernel solvable
• On monochromatic paths in edge-coloured digraphs
• Fractional kernels in digraphs
• The Core of an N Person Game
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage

This page was built for publication: Kernels in weighted digraphs