A Menger-type theorem for two induced paths

DOI10.1137/23M1573082MaRDI QIDQ6499012zbMATH OpenFDO

Authors Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan

Publication date 8 May 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathsconnectivityinduced subgraphsgraph distance

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• On an induced version of Menger's theorem
• scientific article; zbMATH DE number 4059450
• Menger-type theorems with restrictions on path lengths
• scientific article; zbMATH DE number 4144025
• Induced paths in 5-connected graphs

Cites work

• On the complexity of testing for odd holes and induced odd paths

Cited in

(1)

• On an induced version of Menger's theorem

This page was built for publication: A Menger-type theorem for two induced paths

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