A corrected version of the Duchet kernel conjecture

DOI10.1016/S0012-365X(97)00094-0MaRDI QIDQ1377724zbMATH OpenWikidataFDO

Authors Endre Boros, Vladimir Gurvich

Publication date 8 April 1998

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect graphkernel solvability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)

Recommendations

• Parity graphs are kernel-M-solvable
• On kernels in perfect graphs
• Perfect graphs are kernel solvable
• Orientations of graphs in kernel theory
• A note on Duchet's conjecture

Cites work

• scientific article; zbMATH DE number 3891424 (Why is no real title available?)
• scientific article; zbMATH DE number 3904622 (Why is no real title available?)
• scientific article; zbMATH DE number 3382402 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A circular graph---counterexample to the Duchet kernel conjecture
• Graphes Noyau-Parfaits
• Perfect graphs, kernels, and cores of cooperative games
• Recent problems and results about kernels in directed graphs
• Solutions of irreflexive relations

Cited in

(4)

• Parity graphs are kernel-M-solvable
• Vertex- and edge-minimal and locally minimal graphs
• Perfect graphs, kernels, and cores of cooperative games
• Alternating kernels

This page was built for publication: A corrected version of the Duchet kernel conjecture

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