Excluding a simple good pair approach to directed cuts

DOI10.1007/S003730170013zbMath0991.05061OpenAlexW1988310809MaRDI QIDQ5956109

Romeo Rizzi

Publication date: 28 August 2002

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

Full work available at URL: http://eprints.biblio.unitn.it/296/1/81.pdf

zbMATH Keywords

counterexamplecut-equivalent treegood pair

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Intersection properties of maximal directed cuts in digraphs

This page was built for publication: Excluding a simple good pair approach to directed cuts