A characterization of normal fraternally orientable perfect graphs

DOI10.1016/S0012-365X(96)00089-1zbMath0884.05079MaRDI QIDQ1357743

Hortensia Galeana-Sánchez

Publication date: 1 April 1998

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

zbMATH Keywords

digraphkernelkernel-perfect digraphnormal orientationfraternal orientation

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

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 ⋮ Normal fraternally orientable graphs satisfy the strong perfect graph conjecture ⋮ Partial Characterizations of 1‐Perfectly Orientable Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for fraternal orientation of graphs
• In-tournament digraphs
• Triangulated graphs and the elimination process
• Recent problems and results about kernels in directed graphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions

This page was built for publication: A characterization of normal fraternally orientable perfect graphs