Pages that link to "Item:Q2501556"

The following pages link to Longest path partitions in generalizations of tournaments (Q2501556):

Displaying 13 items.

• Computational results on the traceability of oriented graphs of small order (Q396945) (← links)
• A note on a cycle partition problem (Q533476) (← links)
• Cycles in \(k\)-traceable oriented graphs (Q641171) (← 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)
• Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs (Q2000583) (← links)
• \(\alpha\)-diperfect digraphs (Q2113335) (← links)
• Extended path partition conjecture for semicomplete and acyclic compositions (Q2166278) (← links)
• Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
• Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
• Semicomplete compositions of digraphs (Q6041548) (← links)
• <i>k</i>‐quasi‐transitive digraphs of large diameter (Q6055395) (← links)