Reconstructing subgraph-counting graph polynomials of increasing families of graphs
Research output: Contribution to journal › Article › Research › peer-review
Standard
Reconstructing subgraph-counting graph polynomials of increasing families of graphs. / Imrich, Wilfried; Bresar, Boris; Klavzar, Sandi.
In: Discrete mathematics, Vol. 297, 2005, p. 159-166.
In: Discrete mathematics, Vol. 297, 2005, p. 159-166.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Imrich, W, Bresar, B & Klavzar, S 2005, 'Reconstructing subgraph-counting graph polynomials of increasing families of graphs', Discrete mathematics, vol. 297, pp. 159-166.
APA
Imrich, W., Bresar, B., & Klavzar, S. (2005). Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discrete mathematics, 297, 159-166.
Vancouver
Imrich W, Bresar B, Klavzar S. Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discrete mathematics. 2005;297:159-166.
Author
Bibtex - Download
@article{d4a929a8a57840c098d9cc671282b029,
title = "Reconstructing subgraph-counting graph polynomials of increasing families of graphs",
author = "Wilfried Imrich and Boris Bresar and Sandi Klavzar",
year = "2005",
language = "English",
volume = "297",
pages = "159--166",
journal = "Discrete mathematics",
issn = "0012-365X",
publisher = "Elsevier",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Reconstructing subgraph-counting graph polynomials of increasing families of graphs
AU - Imrich, Wilfried
AU - Bresar, Boris
AU - Klavzar, Sandi
PY - 2005
Y1 - 2005
M3 - Article
VL - 297
SP - 159
EP - 166
JO - Discrete mathematics
JF - Discrete mathematics
SN - 0012-365X
ER -
