Maximizing the number of independent subsets over trees with bounded degree

Clemens Heuberger, Stephan Wagner

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

Original language	English
Pages (from-to)	49-68
Journal	Journal of Graph Theory
Volume	58
DOIs	https://doi.org/10.1002/jgt.20294
Publication status	Published - 2008

Treatment code (Nähere Zuordnung)

Basic - Fundamental (Grundlagenforschung)
Application
Theoretical

Access to Document

10.1002/jgt.20294

Analytic Combinatorics: Analytic Combinatorics and Probabilistic Number Theory
Wagner, S., Madritsch, M., Aistleitner, C., Barat, G., Thuswaldner, J., Grabner, P., Van De Woestijne, C. E., Heuberger, C., Brauchart, J., Berkes, I., Filipin, A., Zeiner, M. & Tichy, R.
1/01/06 → 31/07/12
Project: Research project
Asymptotic and Probabilistic Analysis of Algorithms
Haug, N. S. & Heuberger, C.
1/01/99 → 31/01/15
Project: Research area

Cite this

@article{359c724a4c574a31a734baa93340e310,

title = "Maximizing the number of independent subsets over trees with bounded degree",

author = "Clemens Heuberger and Stephan Wagner",

year = "2008",

doi = "10.1002/jgt.20294",

language = "English",

volume = "58",

pages = "49--68",

journal = "Journal of Graph Theory",

issn = "1097-0118 ",

publisher = "Wiley-Blackwell",

}