Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)

DOI10.1007/S00373-015-1591-9zbMath1338.05105OpenAlexW2469804885MaRDI QIDQ295269

Brian C. Wagner

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1591-9

zbMATH Keywords

ascending subgraph decompositiongraph factorizationKirkman triple system

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Ascending subgraph decompositions of oriented graphs that factor into triangles

Cites Work

• Ascending subgraph decompositions of tournaments of order \(6n+3\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)