A family of perfect graphs associated with directed graphs

DOI10.1016/0095-8956(84)90060-1MaRDI QIDQ796547zbMATH OpenOpenAlexFDO

Authors J. 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

minimum cut transversalperfect graph

Mathematics Subject Classification ID

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

Review text

See the preview in Zbl 0535.05030.

Recommendations

• Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
• Maximum directed cuts in acyclic digraphs
• Intersection properties of maximal directed cuts in digraphs
• Special minimum cuts in directed graphs: note.
• scientific article; zbMATH DE number 3891403

Cites work

• A characterization of perfect graphs
• A counterexample to a conjecture of Edmonds and Giles
• A Minimax Theorem for Directed Graphs
• Combinatorial designs related to the strong perfect graph conjecture
• Directed cut transversal packing for source-sink connected graphs
• 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?)
• 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)

• Intersection properties of maximal directed cuts in digraphs
• The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs

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)