Normal fraternally orientable graphs satisfy the strong perfect graph conjecture

DOI10.1016/0012-365X(93)90293-3zbMath0791.05046WikidataQ123281560 ScholiaQ123281560MaRDI QIDQ1313857

Hortensia Galeana-Sánchez

Publication date: 3 July 1994

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

zbMATH Keywords

chromatic number; clique number; strong perfect graph conjecture; colors; complete subgraph; orientable graphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

Related Items

An algorithm for fraternal orientation of graphs, Perfect graphs, kernels, and cores of cooperative games, Kernels and perfectness in arc-local tournament digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On kernel-perfect critical digraphs
• A note on kernel-critical graphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Intersection graphs of concatenable subtrees of graphs
• A characterization of normal fraternally orientable perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Extension Theorems for Solutions of Irreflexive Relations