Note on a min-max conjecture of Woodall

DOI10.1002/jgt.1022zbMath0991.05049OpenAlexW4244341441WikidataQ123291074 ScholiaQ123291074MaRDI QIDQ2746483

Orlando Lee, Yoshiko Wakabayashi

Publication date: 28 August 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1022

zbMATH Keywords

cycledigraphgirtharcsshortest cyclemin-max theoremWoodall's conjectureseries-parallel

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ Complexity of packing common bases in matroids ⋮ \(\alpha\)-diperfect digraphs

Cites Work

• Directed cut transversal packing for source-sink connected graphs
• A counterexample to a conjecture of Edmonds and Giles
• On two minimax theorems in graph
• A Minimax Theorem for Directed Graphs

This page was built for publication: Note on a min-max conjecture of Woodall