Intersecting longest paths and longest cycles: a survey
From MaRDI portal
Recommendations
Cited in
(30)- On a question of van Aardt et al. on destroying all longest cycles
- Transversals of Longest Paths and Cycles
- scientific article; zbMATH DE number 4174966 (Why is no real title available?)
- Detour trees
- Multicluster Interleaving on Paths and Cycles
- Gallai's question and constructions of almost hypotraceable graphs
- All longest cycles in a 2‐connected partial 3‐tree share a common vertex
- On longest cycles in grid graphs
- Nonempty intersection of longest paths in series-parallel graphs
- Nonempty intersection of longest paths in \(2K_2\)-free graphs
- Nonempty intersection of longest paths in a graph with a small matching number
- Improvements on Hippchen's conjecture
- Intersections of longest cycles in grid graphs
- Planar Hypohamiltonian Graphs on 40 Vertices
- Transversals of longest cycles in partial k‐trees and chordal graphs
- Large degree vertices in longest cycles of graphs. II
- Small hitting sets for longest paths and cycles
- Signless normalized Laplacian for hypergraphs
- Lattice graphs with non-concurrent longest cycles
- Longest cycles in vertex-transitive and highly connected graphs
- Bonds Intersecting Long Paths in \(k\) -Connected Graphs
- A note on longest paths in circular arc graphs
- Highly non-concurrent longest paths in lattices
- Intersection of longest paths in graph classes
- Planar lattice graphs with Gallai's property
- Non-empty intersection of longest paths in H-free graphs
- A new approach towards a conjecture on intersecting three longest paths
- Highly non-concurrent longest cycles in lattice graphs
- On platypus graphs and the Steiner-Deogun property
- Highly nonconcurrent longest paths and cycles in lattices
This page was built for publication: Intersecting longest paths and longest cycles: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177022)
