Packing trees into n-chromatic graphs

Research output: Contribution to journalArticle

Abstract

We show that if a sequence of trees T1, T2, ..., Tn-1 can be packed into Kn then they can be also packed into any n-chromatic graph.

Original languageEnglish
Pages (from-to)199-201
Number of pages3
JournalDiscussiones Mathematicae - Graph Theory
Volume34
Issue number1
DOIs
Publication statusPublished - 2014

Fingerprint

Packing
Graph in graph theory

Keywords

  • Tree packing

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Packing trees into n-chromatic graphs. / Gyárfás, A.

In: Discussiones Mathematicae - Graph Theory, Vol. 34, No. 1, 2014, p. 199-201.

Research output: Contribution to journalArticle

@article{32cec645af2d42c9a4fb8654a2f5a0f9,
title = "Packing trees into n-chromatic graphs",
abstract = "We show that if a sequence of trees T1, T2, ..., Tn-1 can be packed into Kn then they can be also packed into any n-chromatic graph.",
keywords = "Tree packing",
author = "A. Gy{\'a}rf{\'a}s",
year = "2014",
doi = "10.7151/dmgt.1735",
language = "English",
volume = "34",
pages = "199--201",
journal = "Discussiones Mathematicae - Graph Theory",
issn = "1234-3099",
publisher = "University of Zielona Gora",
number = "1",

}

TY - JOUR

T1 - Packing trees into n-chromatic graphs

AU - Gyárfás, A.

PY - 2014

Y1 - 2014

N2 - We show that if a sequence of trees T1, T2, ..., Tn-1 can be packed into Kn then they can be also packed into any n-chromatic graph.

AB - We show that if a sequence of trees T1, T2, ..., Tn-1 can be packed into Kn then they can be also packed into any n-chromatic graph.

KW - Tree packing

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

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

U2 - 10.7151/dmgt.1735

DO - 10.7151/dmgt.1735

M3 - Article

AN - SCOPUS:84892658051

VL - 34

SP - 199

EP - 201

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

SN - 1234-3099

IS - 1

ER -