Orientations of graphs in kernel theory

DOI10.1016/0012-365X(91)90136-PzbMath0732.05044OpenAlexW2074536685MaRDI QIDQ809100

Hortensia Galeana-Sánchez, Víctor Neumann-Lara

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90136-p

zbMATH Keywords

problems of kernel theorystrong perfect- graph conjecturestructure of perfect graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (1)

Perfect graphs, kernels, and cores of cooperative games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On kernels and semikernels of digraphs
• On kernel-perfect critical digraphs
• A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
• A note on kernel-critical graphs
• Complement reducible 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
• Extending kernel perfect digraphs to kernel perfect critical digraphs
• Solutions of irreflexive relations
• Graphes Noyau-Parfaits
• Extension Theorems for Solutions of Irreflexive Relations

This page was built for publication: Orientations of graphs in kernel theory