Abstract
In this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut every uv-path of length at least n ( n ≥ 2), in a diagraph D, we need to remove at least h points, then there exist { h (3n − 5) } interior disjoint uv-paths in D of length at least n. Some variations and applications of this theorem are given as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
