Sublinear longest path transversals

DOI10.1137/20M1362577MaRDI QIDQ5009325zbMATH OpenFDO

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

Publication date 20 August 2021

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

Full work available at URL https://doi.org/10.1137/20M1362577

zbMATH Keywords

longest cyclelongest pathmaximum subdivisiontransversal

Mathematics Subject Classification ID

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

Recommendations

• Transversals of Longest Paths and Cycles
• Non-empty intersection of longest paths in H-free graphs
• Improved upper bounds on longest-path and maximal-subdivision transversals

Cites work

• A two-connected planar graph without concurrent longest paths
• scientific article; zbMATH DE number 3577225 (Why is no real title available?)
• scientific article; zbMATH DE number 3451870 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• On longest paths and circuits in graphs.
• Transversals of Longest Paths and Cycles
• Vertices missed by longest paths or circuits
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

Cited in

(6)

• Non-empty intersection of longest paths in H-free graphs
• scientific article; zbMATH DE number 176771 (Why is no real title available?)
• Improved upper bounds on longest-path and maximal-subdivision transversals
• Longest path transversals in claw-free and P₅-free graphs
• Longest cycles in vertex-transitive and highly connected graphs
• Small hitting sets for longest paths and cycles

This page was built for publication: Sublinear longest path transversals

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