Pages that link to "Item:Q1917489"
From MaRDI portal
The following pages link to Independent sets which meet all longest paths (Q1917489):
Displaying 10 items.
- Computational results on the traceability of oriented graphs of small order (Q396945) (← links)
- Girth, minimum degree and transversals of longest paths (Q547535) (← links)
- Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs (Q626767) (← links)
- Traceability of \(k\)-traceable oriented graphs (Q965994) (← links)
- Stable set meeting every longest path (Q1763350) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- Independent detour transversals in 3-deficient digraphs (Q2860857) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Independent transversals of longest paths in locally semicomplete and transitive digraphs (Q3560776) (← links)
- On independent sets and non-augmentable paths in directed graphs (Q4254301) (← links)