List decomposition of graphs

Yair Caro, Raphael Yuster

Research output: Contribution to journalArticlepeer-review


A family of graphs possesses the common gcd property if the greatest common divisor of the degree sequence of each graph in the family is the same. In particular, any family of trees has the common gcd property. Let F = {H1,...,Hr} be a family of graphs having the common gcd property, and let d be the common gcd. It is proved that there exists a constant N = N(F) such that for every n > N for which d divides n -1, and for every equality of the form α1e(H1) +⋯+αre(Hr)= (n/2), where α1,...,αr are nonnegative integers, the complete graph Kn has a decomposition in which each Hi appears exactly αi times. In case F is a family of trees the bound N(F) is shown to be polynomial in the size of F, and, furthermore, a polynomial (in n) time algorithm which generates the required decomposition is presented.

Original languageEnglish
Pages (from-to)67-77
Number of pages11
JournalDiscrete Mathematics
Issue number1-3
StatePublished - 28 Jan 2002


  • Decompositions
  • Designs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'List decomposition of graphs'. Together they form a unique fingerprint.

Cite this