Scholarly Works

Factorizations of Complete Graphs into Trees with...

Journal article

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.

Authors

Fronček D; Kovář P; Kubesa M

Journal

Graphs and Combinatorics, Vol. 27, No. 5, pp. 621–646

Publisher

Springer Nature

Publication Date

September 1, 2011

DOI

10.1007/s00373-010-0991-0

ISSN

0911-0119

Associated Experts

Frantisek Franek

Professor Emeritus, Faculty of Engineering

Labels

Fields of Research (FoR)

4901 Applied mathematics 4904 Pure mathematics 49 Mathematical Sciences 4613 Theory of computation

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback