TY  - JOUR
ID  - Bunge2019
LB  - Bunge2019
AU  - Bunge, Ryan C.
TI  - On 1-rotational decompositions of complete graphs into tripartite graphs
ST  - On 1-rotational decompositions of complete graphs into tripartite graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2019
VL  - 39
IS  - 5
SP  - 623
EP  - 643
DO  - https://doi.org/10.7494/OpMath.2019.39.5.623
UR  - https://doi.org/10.7494/OpMath.2019.39.5.623
AB  - Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let \(G\) be a tripartite graph with \(n\) edges, one of which is a pendent edge. This paper introduces a labeling on such a graph \(G\) used to achieve 1-rotational \(G\)-decompositions of \(K_{2nt}\) for any positive integer \(t\). It is also shown that if \(G\) with a pendent edge is the result of adding an edge to a path on \(n\) vertices, then \(G\) admits such a labeling.
KW  - graph decomposition
KW  - 1-rotational
KW  - vertex labeling
SN  - 1232-9274
ER  -