A family of perfect graphs associated with directed graphs

DOI10.1016/0095-8956(84)90060-1zbMath0544.05033OpenAlexW2050342931MaRDI QIDQ796547

Jeffry Kahn

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90060-1

zbMATH Keywords

perfect graphminimum cut transversal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Directed cut transversal packing for source-sink connected graphs
• A counterexample to a conjecture of Edmonds and Giles
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property
• Combinatorial designs related to the strong perfect graph conjecture
• A characterization of perfect graphs
• Min-max Relations for Directed Graphs
• A Minimax Theorem for Directed Graphs
• Perfect zero–one matrices

This page was built for publication: A family of perfect graphs associated with directed graphs