SÝKORA, O. - SZEKELY, L.A. - VRŤO, Imrich. A note on Halton`s conjecture. In Information Sciences, 2004, vol. 163, s. 61-64. ISSN 0020-0255.
Ohlasy:
[1.1] BARAT, J. - MATOUSEK, J. - WOOD, D.R. Bounded-degree graphs have arbitrarily large geometric thickness. In ELECTRONIC JOURNAL OF COMBINATORICS. ISSN 1077-8926, JAN 7 2006, vol. 13, no. 1., Registrované v: WOS
[3] HARUTYUNYAN, H.A. The global fault-tolerance of interconnection networks. In 7th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2006, s. 171-176.
[1.1] DUJMOVIC, D.— WOOD, D.R. Graph treewidth and geometric thickness parameters. In Discrete & Computational Geometry. ISSN 0179-5376. (0.616 - IF2007), 2007, vol. 37, p. 641-670., Registrované v: WOS
[1.2] HARUTYUNYAN, H.— HE, J. A new peer-to-peer network. In Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007, ISBN 978-0-7695-2788-8, 2007, p. 120-125., Registrované v: SCOPUS
[1.2] MÄKINEN, E. - PORANEN, T. An annotated bibliography on the thickness, outerthickness, and arboricity of a graph. In Missouri Journal of Mathematical Sciences, 2012, 24, 1, pp. 76-87., Registrované v: SCOPUS