Parity graphs are kernel-M-solvable

DOI10.1016/0095-8956(87)90016-5zbMATH Open0675.05063OpenAlexW2084399079MaRDI QIDQ1121920FDOQ1121920

Authors: 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

Recommendations

• Perfect graphs are kernel solvable
• scientific article
• A corrected version of the Duchet kernel conjecture
• Orientations of graphs in kernel theory
• On kernels in perfect graphs

zbMATH Keywords

orientationperfect graphsparity graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Graphes Noyau-Parfaits
• On kernels and semikernels of digraphs
• Topics on perfect graphs
• A parity digraph has a kernel
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• On kernels in perfect graphs
• The strong perfect graph theorem
• On kernels in i-triangulated graphs
• A parity digraph has a kernel
• Lagrangian-perfect hypergraphs
• Perfect graphs, kernels, and cores of cooperative games
• Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121920)