Distinguishing infinite graphs
Research output: Contribution to journal › Article › Research › peer-review
Standard
Distinguishing infinite graphs. / Imrich, Wilfried; Klavzar, Sandi; Trofimov, Vladimir.
In: The journal of combinatorics, Vol. 14, 2007, p. 1-12.
In: The journal of combinatorics, Vol. 14, 2007, p. 1-12.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Imrich, W, Klavzar, S & Trofimov, V 2007, 'Distinguishing infinite graphs', The journal of combinatorics, vol. 14, pp. 1-12.
APA
Imrich, W., Klavzar, S., & Trofimov, V. (2007). Distinguishing infinite graphs. The journal of combinatorics, 14, 1-12.
Vancouver
Imrich W, Klavzar S, Trofimov V. Distinguishing infinite graphs. The journal of combinatorics. 2007;14:1-12.
Author
Bibtex - Download
@article{9af07d3f3cd140be82a80906d9cc3afd,
title = "Distinguishing infinite graphs",
author = "Wilfried Imrich and Sandi Klavzar and Vladimir Trofimov",
year = "2007",
language = "English",
volume = "14",
pages = "1--12",
journal = "The journal of combinatorics",
issn = "1097-1440",
publisher = "Electronic Journal of Combinatorics",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Distinguishing infinite graphs
AU - Imrich, Wilfried
AU - Klavzar, Sandi
AU - Trofimov, Vladimir
PY - 2007
Y1 - 2007
M3 - Article
VL - 14
SP - 1
EP - 12
JO - The journal of combinatorics
JF - The journal of combinatorics
SN - 1097-1440
ER -
