Abstract
We prove that the minimum weight of a dicycle is equal to the maximum number of disjoint dicycle covers, for every weighted digraph whose underlying graph is planar and does not have K 5–e as a minor (K 5–e is the complete graph on five vertices, minus one edge). Equality was previously known when forbidding K 4 as a minor, while an infinite number of weighted digraphs show that planarity does not guarantee equality. The result also improves upon results known for Woodall’s Conjecture and the Edmonds-Giles Conjecture for packing dijoins. Our proof uses Wagner’s characterization of planar 3-connected graphs that do not have K 5–e as a minor.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Guenin, B., Williams, A.: Advances in packing directed joins. In: Second Brazilian Symposium on Graphs, Algorithms and Combinatorics. Electronic Notes in Discrete Mathematics, vol. 7, pp. 212–218 (2005)
Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Annals of Discrete Math. 1, 185–204 (1977)
Feofiloff, P.: Disjoint Transversals of Directed Coboundaries. PhD thesis, University of Waterloo, Ontario, Canada (1983)
Feofiloff, P., Younger, D.H.: Directed cut transversal packing for source-sink connected graphs. Combinatorica 7(3), 255–263 (1987)
Guenin, B., Cornuejols, G.: A note on dijoins. Discrete Math. 243, 213–216 (2002)
Lucchesi, C.L., Younger, D.H.: A minimax relation for directed graphs. J. London Math. Soc. 17(2), 369–374 (1978)
Menger, K.: Zur allgemeinen kurventheoric. Fund. Math. 10, 96–115 (1927)
Wakabayashi, Y., Lee, O.: A note on a min-max conjecture of Woodall. J. Graph Theory 38, 36–41 (2001)
Schrijver, A.: A counterexample to a conjecture of Edmonds and Giles. Discrete Math. 32, 213–214 (1980)
Schrijver, A.: Min-max relations for directed graphs. Annals of Discrete Math. 16, 261–280 (1982)
Wagner, K.: Bemerkungen zu hadwigers vermutung. Ath. Ann. 141, 433–451 (1960)
Williams, A.M.: Packing directed joins. Masters thesis, University of Waterloo, Ontario, Canada (2003)
Woodall, D.R.: Menger and Konig systems. In: Theory and Applications of Graphs. Lecture notes in Mathematics, vol. 642, pp. 620–635. Springer, Heidelberg (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, O., Williams, A. (2006). Packing Dicycle Covers in Planar Graphs with No K 5–e Minor. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_62
Download citation
DOI: https://doi.org/10.1007/11682462_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)