Ascending Subgraph Decompositions of Tournaments of Orders $$6n+2$$ 6 n + 2 and $$6n+1$$ 6 n + 1
Crossref DOI link: https://doi.org/10.1007/s00373-015-1591-9
Published Online: 2015-06-03
Published Print: 2016-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Wagner, Brian C.
Text and Data Mining valid from 2015-06-03