A characterization of normal fraternally orientable perfect graphs
From MaRDI portal
Publication:1357743
DOI10.1016/S0012-365X(96)00089-1zbMath0884.05079MaRDI QIDQ1357743
Publication date: 1 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Partial Characterizations of 1‐Perfectly Orientable Graphs, \(1\)-perfectly orientable graphs and graph products, Normal fraternally orientable graphs satisfy the strong perfect graph conjecture, Perfect graphs, kernels, and cores of cooperative games, Kernels and perfectness in arc-local tournament digraphs
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