The following pages link to (Q3309863):
Displayed 20 items.
- Computational results on the traceability of oriented graphs of small order (Q396945) (← links)
- Some remarks on the structure of strong \(k\)-transitive digraphs (Q472123) (← links)
- Some results on 4-transitive digraphs (Q503671) (← links)
- A note on a cycle partition problem (Q533476) (← links)
- Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs (Q626767) (← links)
- Cycles in \(k\)-traceable oriented graphs (Q641171) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- A linear bound towards the traceability conjecture (Q895060) (← links)
- Traceability of \(k\)-traceable oriented graphs (Q965994) (← links)
- On a cycle partition problem (Q998373) (← links)
- Stable set meeting every longest path (Q1763350) (← links)
- Graphs with not all possible path-kernels (Q1877673) (← links)
- Independent sets which meet all longest paths (Q1917489) (← links)
- Extended path partition conjecture for semicomplete and acyclic compositions (Q2166278) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- On a tree-partition problem (Q3439601) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)