Pages that link to "Item:Q2785375"
From MaRDI portal
The following pages link to Smallest sets of longest paths with empty intersection (Q2785375):
Displaying 16 items.
- Detour trees (Q277622) (← links)
- Intersecting longest paths (Q389499) (← links)
- Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
- Bounding the distance among longest paths in a connected graph (Q1699570) (← links)
- Independent sets which meet all longest paths (Q1917489) (← links)
- Nonempty intersection of longest paths in graphs without forbidden pairs (Q2231747) (← links)
- A note on longest paths in circular arc graphs (Q2516667) (← links)
- Intersecting longest paths in chordal graphs (Q2685319) (← links)
- Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
- Intersection of longest paths in a graph (Q2857437) (← links)
- Nonempty intersection of longest paths in a graph with a small matching number (Q2948007) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? (Q3634208) (← links)
- Intersection of longest paths in graph classes (Q5892302) (← links)
- Intersection of longest paths in graph classes (Q5918842) (← links)
- Intersecting longest cycles in Archimedean tilings (Q6174817) (← links)