Path numbers of tournaments
From MaRDI portal
Cites work
Cited in
(9)- Partitions of digraphs into paths or circuits
- An upper bound on the path number of a digraph
- Covering digraphs by paths
- Decomposing tournaments into paths
- Path covering problems and testing of printed circuits
- Brian Alspach and his work
- Path decompositions of tournaments
- Path decompositions of tournaments
- Path decompositions of oriented graphs
This page was built for publication: Path numbers of tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1212011)