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

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

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

Original languageEnglish (US)
Pages (from-to)621-646
Number of pages26
JournalGraphs and Combinatorics
Volume27
Issue number5
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices'. Together they form a unique fingerprint.

Cite this