Small hitting sets for longest paths and cycles

DOI10.1090/PROC/17582MaRDI QIDQ7237628zbMATH OpenFDO

Authors Serguei Norine, Raphael Steiner, Stéphan Thomassé, Paul Wollan

Publication date 30 April 2026

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/PROC/17582

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A Combinatorial Decomposition Theory
• A note on longest paths in circular arc graphs
• A two-connected planar graph without concurrent longest paths
• Circumference of 3-connected cubic graphs
• Connectivity of transitive graphs
• Gallai's question and constructions of almost hypotraceable graphs
• Graph minors. IX: Disjoint crossed paths
• Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
• Hamilton cycles and paths in vertex-transitive graphs-current directions
• scientific article; zbMATH DE number 2134119 (Why is no real title available?)
• scientific article; zbMATH DE number 4174966 (Why is no real title available?)
• scientific article; zbMATH DE number 3648637 (Why is no real title available?)
• scientific article; zbMATH DE number 3906529 (Why is no real title available?)
• scientific article; zbMATH DE number 3733967 (Why is no real title available?)
• scientific article; zbMATH DE number 3405992 (Why is no real title available?)
• Improved upper bounds on longest-path and maximal-subdivision transversals
• Intersecting longest paths
• Intersecting longest paths and longest cycles: a survey
• Intersecting longest paths in chordal graphs
• Intersection of longest paths in graph classes
• Local 2-separators
• Long cycles in vertex-transitive graphs
• Longest cycles in vertex-transitive and highly connected graphs
• Longest Paths in Circular Arc Graphs
• Non-empty intersection of longest paths in H-free graphs
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Nonempty intersection of longest paths in series-parallel graphs
• On longest paths and circuits in graphs.
• Relative lengths of paths and cycles in 3-connected graphs
• Sublinear longest path transversals
• Transversals of longest cycles in partial k‐trees and chordal graphs
• Transversals of longest paths
• Transversals of Longest Paths and Cycles
• Vertices missed by longest paths or circuits
• What is on his mind?
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

This page was built for publication: Small hitting sets for longest paths and cycles

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