On claw-freeM-oriented critical kernel-imperfect digraphs

DOI10.1002/(SICI)1097-0118(199601)21:1%3C33::AID-JGT4%3E3.0.CO;2-NMaRDI QIDQ4862105zbMATH OpenOpenAlexFDO

Authors Hortensia Galeana-Sánchez

Publication date 29 September 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199601)21:1%3C33::aid-jgt4%3E3.0.co;2-n

zbMATH Keywords

digraphkernelkernel-perfect digraphsMeyniel's conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
• Kernels in digraphs with covering number at most 3
• Orientations of graphs in kernel theory
• k-Kernels in orientations of the line graph
• \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory

Cited in

(6)

• A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
• Claw-free graphs---a survey
• \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory
• k-Kernels in orientations of the line graph
• scientific article; zbMATH DE number 3989377 (Why is no real title available?)
• Graph theoretical structures in logic programs and default theories

This page was built for publication: On claw-freeM-oriented critical kernel-imperfect digraphs

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