Parity graphs are kernel-M-solvable

DOI10.1016/0095-8956(87)90016-5zbMath0675.05063OpenAlexW2084399079MaRDI QIDQ1121920

Pierre Duchet

Publication date: 1987

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(87)90016-5

zbMATH Keywords

orientationperfect graphsparity graph

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (4)

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 ⋮ On kernels in i-triangulated graphs

Cites Work

• On kernels and semikernels of digraphs
• Topics on perfect graphs
• A parity digraph has a kernel
• Graphes Noyau-Parfaits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parity graphs are kernel-M-solvable