A semi-strong perfect digraph theorem

DOI10.1016/j.akcej.2019.12.018zbMath1468.05089arXiv1906.05650OpenAlexW3047804744MaRDI QIDQ4956212

Helena Bergold, Winfried Hochstättler, Johanna Wiehe, Stephan Dominique Andres

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.05650

zbMATH Keywords

perfect graphdichromatic numberperfect digraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A semi-strong perfect graph theorem
• Complement reducible graphs
• The dichromatic number of a digraph
• Algorithmic graph theory and perfect graphs
• Fully dynamic recognition algorithm and certificate for directed cographs
• Perfect Digraphs
• Digraphs

This page was built for publication: A semi-strong perfect digraph theorem