A family of perfect graphs associated with directed graphs
From MaRDI portal
(Redirected from Publication:796547)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- A characterization of perfect graphs
- A counterexample to a conjecture of Edmonds and Giles
- Combinatorial designs related to the strong perfect graph conjecture
- Directed cut transversal packing for source-sink connected graphs
- Min-max Relations for Directed Graphs
- On two minimax theorems in graph
- Perfect zero–one matrices
- The matroids with the max-flow min-cut property
Cited in
(2)
This page was built for publication: A family of perfect graphs associated with directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796547)