\(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory

DOI10.1016/0012-365X(94)00021-AzbMath0835.05029OpenAlexW1987797522MaRDI QIDQ1897444

Hortensia Galeana-Sánchez

Publication date: 19 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00021-a

zbMATH Keywords

digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items

Kernels and perfectness in arc-local tournament digraphs, An algorithm for fraternal orientation of graphs

Cites Work

• Unnamed Item
• On kernels and semikernels of digraphs
• A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
• A note on kernel-critical graphs
• A counterexample to a conjecture of Meyniel on kernel-perfect graphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• An algorithm for fraternal orientation of graphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs