Distinguish graphs of maximum valence 3
Research output: Contribution to journal › Article › Research › peer-review
Standard
Distinguish graphs of maximum valence 3. / Hüning Svenja; Judith Kloas; Hannah Schreiber et al.
In: The electronic journal of combinatorics , Vol. 2019, No. 26, 2019, p. 4 - 31.
In: The electronic journal of combinatorics , Vol. 2019, No. 26, 2019, p. 4 - 31.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Hüning Svenja, Judith Kloas, Hannah Schreiber, Thomas Tucker & Imrich, W 2019, 'Distinguish graphs of maximum valence 3', The electronic journal of combinatorics , vol. 2019, no. 26, pp. 4 - 31.
APA
Hüning Svenja, Judith Kloas, Hannah Schreiber, Thomas Tucker, & Imrich, W. (2019). Distinguish graphs of maximum valence 3. The electronic journal of combinatorics , 2019(26), 4 - 31.
Vancouver
Hüning Svenja, Judith Kloas, Hannah Schreiber, Thomas Tucker, Imrich W. Distinguish graphs of maximum valence 3. The electronic journal of combinatorics . 2019;2019(26):4 - 31.
Author
Bibtex - Download
@article{ca88be890e7443a9b7b52e27fb03ce7e,
title = "Distinguish graphs of maximum valence 3",
author = "{H{\"u}ning Svenja} and {Judith Kloas} and {Hannah Schreiber} and {Thomas Tucker} and Wilfried Imrich",
year = "2019",
language = "English",
volume = "2019",
pages = "4 -- 31",
journal = "The electronic journal of combinatorics ",
issn = "1077-8926",
number = "26",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Distinguish graphs of maximum valence 3
AU - Hüning Svenja
AU - Judith Kloas
AU - Hannah Schreiber
AU - Thomas Tucker
AU - Imrich, Wilfried
PY - 2019
Y1 - 2019
M3 - Article
VL - 2019
SP - 4
EP - 31
JO - The electronic journal of combinatorics
JF - The electronic journal of combinatorics
SN - 1077-8926
IS - 26
ER -
