Number of the records: 1
A note on Halton`s conjecture
Title A note on Halton`s conjecture Author Sýkora O. Vrťo Imrich 1953 SAVMATEM - Matematický ústav SAV Co-authors Szekely L.A. Source document Information Sciences. Vol. 163 (2004), s. 61-64 Language eng - English Country US - United States of America Document kind rozpis článkov z periodík (rbx) Citations 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. 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. 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. 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. 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. Category ADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted) Category of document (from 2022) V3 - Vedecký výstup publikačnej činnosti z časopisu Type of document článok Year 2004 
article
rok CC IF IF Q (best) JCR Av Jour IF Perc SJR SJR Q (best) CiteScore A rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2004
Number of the records: 1