Transversals of Longest Paths and Cycles

DOI10.1137/130910658zbMath1293.05183arXiv1302.5503OpenAlexW4297936050MaRDI QIDQ4979843

Jean-Sébastien Sereni, Dieter Rautenbach

Publication date: 19 June 2014

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

Full work available at URL: https://arxiv.org/abs/1302.5503

zbMATH Keywords

transversallongest cyclelongest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (19)

Detour trees ⋮ Well-partitioned chordal graphs ⋮ Transversals of longest cycles in partial k‐trees and chordal graphs ⋮ Improved upper bounds on longest-path and maximal-subdivision transversals ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Intersecting longest paths in chordal graphs ⋮ The complexity of blocking (semi)total dominating sets with edge contractions ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ Intersection of longest paths in graph classes ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Intersection of longest paths in graph classes ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Unnamed Item ⋮ Reducing graph transversals via edge contractions ⋮ A note on longest paths in circular arc graphs ⋮ Transversals of longest paths ⋮ Sublinear Longest Path Transversals ⋮ Using edge contractions to reduce the semitotal domination number

This page was built for publication: Transversals of Longest Paths and Cycles