Ascending subgraph decompositions of oriented graphs that factor into triangles

DOI10.7151/dmgt.2306zbMath1492.05124OpenAlexW3007238756MaRDI QIDQ2151215

Brian C. Wagner, Andrea D. Austin

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2306

zbMATH Keywords

ascending subgraph decompositiongraph factorizationOberwolfach problem

Mathematics Subject Classification ID

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

Cites Work

• Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)
• Ascending subgraph decompositions in oriented complete balanced tripartite graphs
• On a variation of the Oberwolfach problem
• Ascending subgraph decompositions of regular graphs
• The equipartite Oberwolfach problem with uniform tables
• Ascending subgraph decompositions of tournaments of order \(6n+3\)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ascending subgraph decompositions of oriented graphs that factor into triangles