Sublinear Longest Path Transversals

DOI10.1137/20M1362577zbMath1470.05091MaRDI QIDQ5009325

Andrea Munaro, Kevin G. Milans, James A. jun. Long

Publication date: 20 August 2021

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

zbMATH Keywords

transversallongest cyclelongest pathmaximum subdivision

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

Improved upper bounds on longest-path and maximal-subdivision transversals ⋮ Non-empty intersection of longest paths in \(H\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• On longest paths and circuits in graphs.
• Transversals of Longest Paths and Cycles
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

This page was built for publication: Sublinear Longest Path Transversals