Factorizations of complete graphs into caterpillars of diameter 5

Dalibor Froncek; Petr Kovář; Tereza Kovářová; Michael Kubesa

doi:10.1016/j.disc.2009.03.040

Factorizations of complete graphs into caterpillars of diameter 5

Dalibor Froncek
, Petr Kovář
, Tereza Kovářová
, Michael Kubesa

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

3 Scopus citations

Abstract

We examine factorizations of complete graphs K_{2 n} into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K_{2 n}.

Original language	English (US)
Pages (from-to)	537-556
Number of pages	20
Journal	Discrete Mathematics
Volume	310
Issue number	3
DOIs	https://doi.org/10.1016/j.disc.2009.03.040
State	Published - Feb 6 2010
Externally published	Yes

Keywords

Graph factorization
Graph labeling
Spanning trees

Publisher link

10.1016/j.disc.2009.03.040

Find It

Find It at U of M Libraries

Cite this

@article{32dfe6a102ec4c83998de3769faf1606,

title = "Factorizations of complete graphs into caterpillars of diameter 5",

abstract = "We examine factorizations of complete graphs K2 n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K2 n.",

keywords = "Graph factorization, Graph labeling, Spanning trees",

author = "Dalibor Froncek and Petr Kov{\'a}{\v r} and Tereza Kov{\'a}{\v r}ov{\'a} and Michael Kubesa",

year = "2010",

month = feb,

day = "6",

doi = "10.1016/j.disc.2009.03.040",

language = "English (US)",

volume = "310",

pages = "537--556",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Factorizations of complete graphs into caterpillars of diameter 5

AU - Froncek, Dalibor

AU - Kovář, Petr

AU - Kovářová, Tereza

AU - Kubesa, Michael

PY - 2010/2/6

Y1 - 2010/2/6

N2 - We examine factorizations of complete graphs K2 n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K2 n.

AB - We examine factorizations of complete graphs K2 n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K2 n.

KW - Graph factorization

KW - Graph labeling

KW - Spanning trees

UR - https://www.scopus.com/pages/publications/70449721419

UR - https://www.scopus.com/pages/publications/70449721419#tab=citedBy

U2 - 10.1016/j.disc.2009.03.040

DO - 10.1016/j.disc.2009.03.040

M3 - Article

AN - SCOPUS:70449721419

SN - 0012-365X

VL - 310

SP - 537

EP - 556

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

Factorizations of complete graphs into caterpillars of diameter 5

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this