APA:
Fijavž, Gašper, Negami, Seiya, Terukazu, Sano (2011). 3-Connected planar graphs are 5-distinguishing colorable with two exceptions.
Ars mathematica contemporanea, letnik 4, številka 1, str. 165-175.
URN:NBN:SI:doc-FA41EGJV from http://www.dlib.si
MLA:
Fijavž, Gašper, Negami, Seiya, Terukazu, Sano. "3-Connected planar graphs are 5-distinguishing colorable with two exceptions."
Ars mathematica contemporanea letnik 4. številka 1 (2011) str. 165-175.
<http://www.dlib.si/?URN=URN:NBN:SI:doc-FA41EGJV>