Образец цитирования:
В. А. Курлин, “Трехстраничные диаграммы Дынникова заузленных 3-валентных графов”, Функц. анализ и его прил., 35:3 (2001), 84–88; Funct. Anal. Appl., 35:3 (2001), 230–233
Yury Elkin, Di Liu, Vitaliy Kurlin, Mathematics and Visualization, Topological Methods in Data Analysis and Visualization VI, 2021, 245
Bright M. Kurlin V., “Encoding and Topological Computation on Textile Structures”, Comput. Graph.-UK, 90 (2020), 51–61
Kurlin V., Smithers Ch., “a Linear Time Algorithm For Embedding Arbitrary Knotted Graphs Into a 3-Page Book”, Computer Vision, Imaging and Computer Graphics Theory and Applications, Communications in Computer and Information Science, 598, eds. Braz J., Pettre J., Richard P., Kerren A., Linsen L., Battiato S., Imai F., Springer-Verlag Berlin, 2016, 99–122
Kurlin, V, “Three-page encoding and complexity theory for spatial graphs”, Journal of Knot Theory and Its Ramifications, 16:1 (2007), 59
Dujmovic, V, “Stacks, queues and tracks: Layouts of graph subdivisions”, Discrete Mathematics and Theoretical Computer Science, 7:1 (2005), 155
В. В. Вершинин, В. А. Курлин, “Трехстраничные вложения сингулярных узлов”, Функц. анализ и его прил., 38:1 (2004), 16–33; V. V. Vershinin, V. A. Kurlin, “Three-Page Embeddings of Singular Knots”, Funct. Anal. Appl., 38:1 (2004), 14–27
В. А. Курлин, “Базисные вложения графов и метод трехстраничных вложений Дынникова”, УМН, 58:2(350) (2003), 163–164; V. A. Kurlin, “Basic embeddings of graphs and Dynnikov's three-page embedding method”, Russian Math. Surveys, 58:2 (2003), 372–374