Decomposition of complete graphs on n 0,114 vertices into disconnected unicyclic tripartite graphs on seven edges

DOI10.61091/JCMCC129-06MaRDI QIDQ6858602zbMATH OpenFDO

Authors D. M. Banegas, Aidan Carlson, Lory Hawkes, M. Heck, C. Higgins, Y. Hong, K. Jiang, N. Palme, D. Qi, X. Sundvall, J. Waadevig, Bryan Freyberg, Dalibor Fronček

Publication date 12 February 2026

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC129-06

zbMATH Keywords

\(\rho\)-labeling\(G\)-designgraph decompositiontripartite graph

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.
• Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices
• scientific article; zbMATH DE number 3710227 (Why is no real title available?)
• scientific article; zbMATH DE number 2028650 (Why is no real title available?)
• scientific article; zbMATH DE number 2114468 (Why is no real title available?)
• scientific article; zbMATH DE number 7475412 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• On 1-rotational decompositions of complete graphs into tripartite graphs
• On cyclic decompositions of complete graphs into tripartite graphs
• On the cyclic decomposition of complete graphs into bipartite graphs

Cited in

(1)

• Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices

This page was built for publication: Decomposition of complete graphs on \(n\equiv 0,1\pmod{14}\) vertices into disconnected unicyclic tripartite graphs on seven edges

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