Ascending subgraph decompositions in oriented complete balanced tripartite graphs

DOI10.1007/S00373-012-1208-5zbMATH Open1272.05067OpenAlexW2029321590MaRDI QIDQ367066FDOQ367066

Authors: Brian C. Wagner 

Publication date: 26 September 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1208-5

Recommendations

• Ascending subgraph decompositions of oriented graphs that factor into triangles
• Ascending subgraph decompositions of tournaments of order \(6n+3\)
• Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)
• scientific article; zbMATH DE number 1092186
• A note on ascending subgraph decompositions of complete multipartite graphs

zbMATH Keywords

ascending subgraph decompositiongraph factorizationOberwolfach problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the ascending subgraph decomposition problem
• Ascending subgraph decompositions of regular graphs
• The equipartite Oberwolfach problem with uniform tables

Cited In (4)

• Ascending subgraph decompositions of tournaments of order \(6n+5\)
• Ascending subgraph decompositions of tournaments of orders \(6n+2\) and \(6n+1\)
• Ascending subgraph decompositions of oriented graphs that factor into triangles
• Ascending subgraph decompositions of tournaments of order \(6n+3\)

This page was built for publication: Ascending subgraph decompositions in oriented complete balanced tripartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367066)