TY - JOUR

T1 - Self-complementary factors of almost complete tripartite graphs of even order

AU - Fronček, Dalibor

PY - 2001/6/6

Y1 - 2001/6/6

N2 - A complete tripartite graph without one edge, K̃m1, m2, m3 is called almost complete tripartite graph. A graph K̃m1, m2, m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃m1, m2, m3 is d-halvable for a finite d only if d ≤ 5 and completely determine all triples 2m′1 + 1, 2m′2 + 1, 2m′3 for which there exist d-halvable almost complete tripartite graphs for diameters 3,4 and 5, respectively.

AB - A complete tripartite graph without one edge, K̃m1, m2, m3 is called almost complete tripartite graph. A graph K̃m1, m2, m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃m1, m2, m3 is d-halvable for a finite d only if d ≤ 5 and completely determine all triples 2m′1 + 1, 2m′2 + 1, 2m′3 for which there exist d-halvable almost complete tripartite graphs for diameters 3,4 and 5, respectively.

KW - Graph decompositions

KW - Isomorphic factors

KW - Self-complementary graphs

UR - http://www.scopus.com/inward/record.url?scp=0035815944&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035815944&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(00)00435-0

DO - 10.1016/S0012-365X(00)00435-0

M3 - Article

AN - SCOPUS:0035815944

VL - 236

SP - 111

EP - 122

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -