Note on a min-max conjecture of Woodall

DOI10.1002/JGT.1022zbMATH Open0991.05049OpenAlexW4244341441WikidataQ123291074 ScholiaQ123291074MaRDI QIDQ2746483FDOQ2746483

Authors: 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

Recommendations

• On a conjecture of Woodall
• Integer Programming and Combinatorial Optimization
• A note on disjoint dijoins
• scientific article; zbMATH DE number 2188339
• scientific article; zbMATH DE number 147638

zbMATH Keywords

cycledigraphgirthshortest cycleWoodall's conjecturearcsmin-max theoremseries-parallel

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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

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