Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

Dalibor Fronček

doi:10.1007/bf01858463

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

Dalibor Fronček

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.

Original language	English (US)
Pages (from-to)	305-320
Number of pages	16
Journal	Graphs and Combinatorics
Volume	12
Issue number	4
DOIs	https://doi.org/10.1007/bf01858463
State	Published - Jan 1 1996

Keywords

Graph decompositions
Isomorphic factors
Selfcomplementary graphs

Access

10.1007/bf01858463

OpenUrl availability

Full text

Cite this

@article{0838a1cb3fe84ca1a957fde702c128f0,

title = "Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters",

abstract = "We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.",

keywords = "Graph decompositions, Isomorphic factors, Selfcomplementary graphs",

author = "Dalibor Fron{\v c}ek",

year = "1996",

month = jan,

day = "1",

doi = "10.1007/bf01858463",

language = "English (US)",

volume = "12",

pages = "305--320",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "4",

}

TY - JOUR

T1 - Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

AU - Fronček, Dalibor

PY - 1996/1/1

Y1 - 1996/1/1

N2 - We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.

AB - We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter.

KW - Graph decompositions

KW - Isomorphic factors

KW - Selfcomplementary graphs

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

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

U2 - 10.1007/bf01858463

DO - 10.1007/bf01858463

M3 - Article

AN - SCOPUS:0040585869

SN - 0911-0119

VL - 12

SP - 305

EP - 320

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 4

ER -

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this