Special minimum cuts in directed graphs: note.

MaRDI QIDQ2823203zbMATH OpenFDO

Authors Ottilia Fülöp

Publication date 6 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

odd minimum \((S,T)\)-cutodd minimum \(\overline T\)-cuttriple family

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 2188469
• Covering directed and odd cuts
• scientific article; zbMATH DE number 1670649
• On computing minimum(s,t)-cuts in digraphs
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

Cited in

(4)

• scientific article; zbMATH DE number 634021 (Why is no real title available?)
• scientific article; zbMATH DE number 2188469 (Why is no real title available?)
• Excluding a simple good pair approach to directed cuts
• A family of perfect graphs associated with directed graphs

This page was built for publication: Special minimum cuts in directed graphs: note.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823203)