On decomposing the complete symmetric digraph into orientations of \(K_4 - e\)

DOI10.7151/dmgt.2101zbMath1415.05112OpenAlexW2803389198MaRDI QIDQ2312061

Hanson H. Hao, Dan P. Roberts, Gregory L. Keller, Saad I. El-Zanati, Toni M. Dubczuk, Brian D. jun. Darrow, Genevieve A. Newkirk, Ryan C. Bunge

Publication date: 4 July 2019

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

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

zbMATH Keywords

digraph decompositionsorientations of \(K_4 - e\)

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph designs and isomorphic decomposition (05C51)

Cites Work

• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• A survey on the existence ofG-Designs
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On decomposing the complete symmetric digraph into orientations of \(K_4 - e\)