2-halvable complete 4-partite graphs

Dalibor Fronček. "2-halvable complete 4-partite graphs." Discussiones Mathematicae Graph Theory 18.2 (1998): 233-242. <http://eudml.org/doc/270258>.

@article{DaliborFronček1998,
abstract = {A complete 4-partite graph $K_\{m₁,m₂,m₃,m₄\}$ is called d-halvable if it can be decomposed into two isomorphic factors of diameter d. In the class of graphs $K_\{m₁,m₂,m₃,m₄\}$ with at most one odd part all d-halvable graphs are known. In the class of biregular graphs $K_\{m₁,m₂,m₃,m₄\}$ with four odd parts (i.e., the graphs $K_\{m,m,m,n\}$ and $K_\{m,m,n,n\}$) all d-halvable graphs are known as well, except for the graphs $K_\{m,m,n,n\}$ when d = 2 and n ≠ m. We prove that such graphs are 2-halvable iff n,m ≥ 3. We also determine a new class of non-halvable graphs $K_\{m₁,m₂,m₃,m₄\}$ with three or four different odd parts.},
author = {Dalibor Fronček},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {Graph decompositions; isomorphic factors; selfcomplementary graphs; 2-halvable graphs; complete 4-partite graphs},
language = {eng},
number = {2},
pages = {233-242},
title = {2-halvable complete 4-partite graphs},
url = {http://eudml.org/doc/270258},
volume = {18},
year = {1998},
}

TY - JOUR
AU - Dalibor Fronček
TI - 2-halvable complete 4-partite graphs
JO - Discussiones Mathematicae Graph Theory
PY - 1998
VL - 18
IS - 2
SP - 233
EP - 242
AB - A complete 4-partite graph $K_{m₁,m₂,m₃,m₄}$ is called d-halvable if it can be decomposed into two isomorphic factors of diameter d. In the class of graphs $K_{m₁,m₂,m₃,m₄}$ with at most one odd part all d-halvable graphs are known. In the class of biregular graphs $K_{m₁,m₂,m₃,m₄}$ with four odd parts (i.e., the graphs $K_{m,m,m,n}$ and $K_{m,m,n,n}$) all d-halvable graphs are known as well, except for the graphs $K_{m,m,n,n}$ when d = 2 and n ≠ m. We prove that such graphs are 2-halvable iff n,m ≥ 3. We also determine a new class of non-halvable graphs $K_{m₁,m₂,m₃,m₄}$ with three or four different odd parts.
LA - eng
KW - Graph decompositions; isomorphic factors; selfcomplementary graphs; 2-halvable graphs; complete 4-partite graphs
UR - http://eudml.org/doc/270258
ER -