Ascending subgraph decompositions of tournaments of order \(6n+3\)
From MaRDI portal
Publication:2637740
DOI10.1007/s00373-012-1236-1zbMath1285.05082OpenAlexW2032640179MaRDI QIDQ2637740
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1236-1
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\) ⋮ Ascending subgraph decompositions of oriented graphs that factor into triangles
Cites Work
This page was built for publication: Ascending subgraph decompositions of tournaments of order \(6n+3\)