Kernels in some orientations of comparability graphs

DOI10.1016/0095-8956(89)90070-1zbMath0681.05037OpenAlexW2095492932MaRDI QIDQ1823257

Christophe Champetier

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90070-1

zbMATH Keywords

kernelperfect graphdirected graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Perfect graphs, kernels, and cores of cooperative games ⋮ Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable ⋮ On kernels in perfect graphs

Cites Work

• Unnamed Item
• On monochromatic paths in edge-coloured digraphs
• Graphes Noyau-Parfaits
• On the orientation of meyniel graphs

This page was built for publication: Kernels in some orientations of comparability graphs