Number of the records: 1
Outerplanar crossing numbers of 3-row meshes, Halin graphs and complete p-partite graphs
Title Outerplanar crossing numbers of 3-row meshes, Halin graphs and complete p-partite graphs Co-authors Fulek R. Vrťo Imrich 1953 (Author) SAVMATEM - Matematický ústav SAV Another authors Hongmei H.E. (Author) Sýkora O. (Author) Source document Lecture Notes in Computer Science, Vol. 3381. S. 371-374. - : Springer, 2005 Language eng - English Country DE - Germany Document kind rozpis článkov z periodík (rzb) Citations RISKIN, A. The circular k-partite crossing number of K_{m,n}, Australasian Journal of Combinatorics, ISSN 1034-4942, 2007, vol. 38, p. 207-210. DE KLERK, E. - PASECHNIK, D. V. IMPROVED LOWER BOUNDS FOR THE 2-PAGE CROSSING NUMBERS OF Km,n AND Kn VIA SEMIDEFINITE PROGRAMMING. In SIAM JOURNAL ON OPTIMIZATION. ISSN 1052-6234, 2012, vol. 22, no. 2, pp. 581-595. SCHAEFER, M. The graph crossing number and its variants: A survey. In The Electronic Journal of Combinatorics, ISSN 1077-8926, 2013, vol. 20, #DS21. KOBAYASHI, Yasuaki - OHTSUKA, Hiromu - TAMAKI, Hisao. An improved fixed-parameter algorithm for one-page crossing minimization. In Leibniz International Proceedings in Informatics, LIPIcs. ISSN 18688969, 2018, vol. 89. SCHAEFER, Marcus. The graph crossing number and its variants: A survey. In Electronic Journal of Combinatorics, 2018, vol. 1, dynamicSurveys, art. no. DS21. Category AEC - Scientific papers in foreign peer-reviewed proceedings, monographs Category of document (from 2022) V2 - Vedecký výstup publikačnej činnosti ako časť editovanej knihy alebo zborníka Type of document príspevok Year 2005 
article
rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2005
Number of the records: 1