Normal fraternally orientable graphs satisfy the strong perfect graph conjecture

DOI10.1016/0012-365X(93)90293-3MaRDI QIDQ1313857zbMATH OpenOpenAlexWikidataFDO

Authors Hortensia Galeana-Sánchez

Publication date 3 July 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90293-3

zbMATH Keywords

chromatic numberclique numbercolorscomplete subgraphorientable graphsstrong perfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The strong perfect graph theorem
• The strong perfect graph conjecture for pan-free graphs
• scientific article; zbMATH DE number 1789914
• Orientations of graphs in kernel theory
• On the strong perfect graph conjecture

Cites work

• A characterization of normal fraternally orientable perfect graphs
• A note on kernel-critical graphs
• 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
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Intersection graphs of concatenable subtrees of graphs
• Normal hypergraphs and the perfect graph conjecture
• On kernel-perfect critical digraphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes

Cited in

(8)

• An algorithm for fraternal orientation of graphs
• A characterization of normal fraternally orientable perfect graphs
• 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
• Perfect graphs, kernels, and cores of cooperative games
• Kernels and perfectness in arc-local tournament digraphs
• \(1\)-perfectly orientable graphs and graph products
• Partial characterizations of 1-perfectly orientable graphs
• Orientations of graphs in kernel theory

This page was built for publication: Normal fraternally orientable graphs satisfy the strong perfect graph conjecture

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