A Mengerian theorem for paths of length at least three

DOI10.1002/JGT.3190100412MaRDI QIDQ3743329zbMATH OpenOpenAlexFDO

Authors Michael Hager

Publication date 1986

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

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

zbMATH Keywords

Mengerianpaths

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Graph theory (05C99)

Recommendations

• Menger-type theorems with restrictions on path lengths
• Long paths through specified vertices in \(3\)-connected graphs
• A variation of Menger's theorem for long paths
• scientific article; zbMATH DE number 4089593
• Menger's theorem

Cited in

(7)

• Generalized degrees and Menger path systems
• A new approach towards a conjecture on intersecting three longest paths
• Wide diameter and minimum length of disjoint Menger path systems
• scientific article; zbMATH DE number 4059450 (Why is no real title available?)
• scientific article; zbMATH DE number 4089593 (Why is no real title available?)
• Strings of length 3 in grand-Dyck paths and the Chung-Feller property
• scientific article; zbMATH DE number 1146232 (Why is no real title available?)

This page was built for publication: A Mengerian theorem for paths of length at least three

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