scientific article; zbMATH DE number 568832
From MaRDI portal
Publication:4294624
Cited in
(8)- Triangle packings and 1-factors in oriented graphs
- Partitioning vertices of a tournament into independent cycles
- \(k\)-ary spanning trees contained in tournaments
- On 1-factors with prescribed lengths in tournaments
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- Combinatorial and computational aspects of graph packing and graph decomposition
- Transitive tournament tilings in oriented graphs with large minimum total degree
- A note between transitive C₄-factor and oriented Ramsey number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294624)