On claw-freeM-oriented critical kernel-imperfect digraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<33::AID-JGT4>3.0.CO;2-N" /><33::AID-JGT4>3.0.CO;2-N 10.1002/(SICI)1097-0118(199601)21:1<33::AID-JGT4>3.0.CO;2-NzbMath0846.05039OpenAlexW4241359689MaRDI QIDQ4862105

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<33::aid-jgt4>3.0.co;2-n

zbMATH Keywords

digraphkernelkernel-perfect digraphsMeyniel's conjecture

Mathematics Subject Classification ID

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

Related Items (2)

Claw-free graphs---a survey ⋮ Graph theoretical structures in logic programs and default theories

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