Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

Dalibor Fronček; Petr Kovář; Michael Kubesa

doi:10.1007/s00373-010-0991-0

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

Dalibor Fronček
, Petr Kovář
, Michael Kubesa

Mathematics & Statistics

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

1 Scopus citations

Abstract

We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K_2n.

Original language	English (US)
Pages (from-to)	621-646
Number of pages	26
Journal	Graphs and Combinatorics
Volume	27
Issue number	5
DOIs	https://doi.org/10.1007/s00373-010-0991-0
State	Published - Sep 2011

Bibliographical note

Funding Information:
P. Kovář and M. Kubesa were supported by the Ministry of Education of the Czech Republic Grant No. MSM6198910027.

Keywords

Graph factorization
Graph labeling
Spanning trees

Publisher link

10.1007/s00373-010-0991-0

Find It

Find It at U of M Libraries

Cite this

@article{fac8cb464f344820be48db3b6cbc1e94,

title = "Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices",

abstract = "We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K2n.",

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

author = "Dalibor Fron{\v c}ek and Petr Kov{\'a}{\v r} and Michael Kubesa",

note = "Funding Information: P. Kov{\'a}{\v r} and M. Kubesa were supported by the Ministry of Education of the Czech Republic Grant No. MSM6198910027.",

year = "2011",

month = sep,

doi = "10.1007/s00373-010-0991-0",

language = "English (US)",

volume = "27",

pages = "621--646",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "5",

}

TY - JOUR

T1 - Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

AU - Fronček, Dalibor

AU - Kovář, Petr

AU - Kubesa, Michael

N1 - Funding Information: P. Kovář and M. Kubesa were supported by the Ministry of Education of the Czech Republic Grant No. MSM6198910027.

PY - 2011/9

Y1 - 2011/9

N2 - We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K2n.

AB - We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K2n.

KW - Graph factorization

KW - Graph labeling

KW - Spanning trees

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

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

U2 - 10.1007/s00373-010-0991-0

DO - 10.1007/s00373-010-0991-0

M3 - Article

AN - SCOPUS:80051549679

SN - 0911-0119

VL - 27

SP - 621

EP - 646

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 5

ER -

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this