TY - JOUR

T1 - Range of diameters of complementary factors of almost complete tripartite graphs

AU - Fronček, Dalibor

PY - 2000/5

Y1 - 2000/5

N2 - A complete tripartite graph without one edge, K̃m1,m2,m3, is called almost complete tripartite graph. A graph that 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.

AB - A complete tripartite graph without one edge, K̃m1,m2,m3, is called almost complete tripartite graph. A graph that 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.

KW - Graph decompositions

KW - Isomorphic factors

KW - Self-complementary graphs

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

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

M3 - Article

AN - SCOPUS:17544400637

SN - 0315-3681

VL - 57

SP - 211

EP - 225

JO - Utilitas Mathematica

JF - Utilitas Mathematica

ER -