Smallest sets of longest paths with empty intersection
From MaRDI portal
Recommendations
- Nonempty intersection of longest paths in a graph with a small matching number
- scientific article; zbMATH DE number 4174966
- Intersection of longest paths in a graph
- Nonempty intersection of longest paths in graphs without forbidden pairs
- Intersection of longest paths in graph classes
- Intersection of longest paths in graph classes
- Non-empty intersection of longest paths in H-free graphs
- Shortest Paths between Shortest Paths and Independent Sets
- scientific article; zbMATH DE number 3105908
- Intersecting longest paths
Cites work
Cited in
(19)- Bounding the distance among longest paths in a connected graph
- Independent sets which meet all longest paths
- Nonempty intersection of longest paths in graphs without forbidden pairs
- A note on longest paths in circular arc graphs
- Intersecting longest paths in chordal graphs
- Non-empty intersection of longest paths in H-free graphs
- Detour trees
- Intersection of longest paths in a graph
- Nonempty intersection of longest paths in a graph with a small matching number
- Shortest Paths between Shortest Paths and Independent Sets
- scientific article; zbMATH DE number 4174966 (Why is no real title available?)
- Non-intersecting detours in strong oriented graphs
- WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
- Intersecting longest paths
- Intersecting longest paths and longest cycles: a survey
- Intersection of longest paths in graph classes
- Intersection of longest paths in graph classes
- Intersecting longest cycles in Archimedean tilings
- Nonempty intersection of longest paths in series-parallel graphs
This page was built for publication: Smallest sets of longest paths with empty intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785375)