References analysis of the Wikipedia article "Книжкове вкладення" in the Ukrainian version

archive.org

Vida Dujmović, Anastasios Sidiropoulos, David R. Wood. 3-Monotone Expanders. — 2015. — arXiv:1501.05020., покращення ранішого результату Jean Bourgain. Expanders and dimensional expansion // Comptes Rendus Mathématique. — 2009. — Т. 347, вип. 7—8. — С. 357–362. — DOI:10.1016/j.crma.2009.02.009.; Jean Bourgain, Amir Yehudayoff. Expansion in

{\rm {SL}}_{2}(\mathbb {R} )

and monotone expanders // Geometric and Functional Analysis. — 2013. — Т. 23, вип. 1. — С. 1–41. — DOI:10.1007/s00039-012-0200-9.. Див. також Zvi Gali, Ravi Kannan, Endre Szemerédi. On 3-pushdown graphs with large separators // Combinatorica. — 1989. — Т. 9, вип. 1. — С. 9–19. — DOI:10.1007/BF02122679.; Zeev Dvir, Avi Wigderson. Monotone expanders: constructions and applications // Theory of Computing. — 2010. — Т. 6. — С. 291–308. — DOI:10.4086/toc.2010.v006a012.

arxiv.org

{\rm {SL}}_{2}(\mathbb {R} )

doi.org

dx.doi.org

Walter Unger. STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13–15, 1992, Proceedings. — Berlin : Springer, 1992. — Т. 577. — С. 389–400. — (Lecture Notes in Computer Science) — DOI:10.1007/3-540-55210-3_199..

T. C. Hales. Sphere packings. II // Discrete & Computational Geometry. — 1997. — Т. 18, вип. 2. — С. 135–149. — DOI:10.1007/PL00009312..

Elena Stöhr. A trade-off between page number and page width of book embeddings of graphs // Information and Computation. — 1988. — Т. 79, вип. 2. — С. 155–162. — DOI:10.1016/0890-5401(88)90036-3..

Elena Stöhr. The pagewidth of trivalent planar graphs // Discrete Mathematics. — 1991. — Т. 89, вип. 1. — С. 43–49. — DOI:10.1016/0012-365X(91)90398-L..

Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota. Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph // Discrete Applied Mathematics. — 1999. — Т. 92, вип. 2—3. — С. 149–155. — DOI:10.1016/S0166-218X(99)00044-X..

Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar. Proceedings of the 28th Annual Symposium on Computational Geometry (SCG'12). — ACM, New York, 2012. — С. 397–403. — DOI:10.1145/2261250.2261310.

Більше результатів щодо книжкової товщини повних двочасткових графів див. Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar. Book drawings of complete bipartite graphs // Discrete Applied Mathematics. — 2014. — Т. 167. — С. 80–93. — DOI:10.1016/j.dam.2013.11.001..

Toru Hasunuma, Yukio Shibata. Embedding de Bruijn, Kautz and shuffle-exchange networks in books // Discrete Applied Mathematics. — 1997. — Т. 78, вип. 1—3. — С. 103–116. — DOI:10.1016/S0166-218X(97)00009-7. Yuuki Tanaka, Yukio Shibata. On the pagenumber of the cube-connected cycles // Mathematics in Computer Science. — 2010. — Т. 3, вип. 1. — С. 109–117. — DOI:10.1007/s11786-009-0012-y. Див. також Bojana Obrenić. Embedding de Bruijn and shuffle-exchange graphs in five pages // SIAM Journal on Discrete Mathematics. — 1993. — Т. 6, вип. 4. — С. 642–654. — DOI:10.1137/0406049..

Lenny Heath. Proceedings of the 25th Annual Symposium on Foundations of Computer Science. — 1984. — С. 74–83. — DOI:10.1109/SFCS.1984.715903.

Joseph L. Ganley, Lenwood S. Heath. The pagenumber of k-trees is O(k) // Discrete Applied Mathematics. — 2001. — Т. 109, вип. 3. — С. 215–221. — DOI:10.1016/S0166-218X(00)00178-5..

Seth M. Malitz. Graphs with E edges have pagenumber O(√E) // Journal of Algorithms : журнал. — 1994. — Т. 17, вип. 1 (7). — С. 71–84. — DOI:10.1006/jagm.1994.1027.

Seth M. Malitz. Genus g graphs have pagenumber O(√g) // Journal of Algorithms. — 1994. — Т. 17, вип. 1. — С. 85–109. — DOI:10.1006/jagm.1994.1028..

{\rm {SL}}_{2}(\mathbb {R} )

Lenwood S. Heath, Arnold L. Rosenberg. Laying out graphs using queues // SIAM Journal on Computing. — 1992. — Т. 21, вип. 5. — С. 927–958. — DOI:10.1137/0221055..

M. R. Garey, D. S. Johnson, G. L. Miller, C. H. Papadimitriou. The complexity of coloring circular arcs and chords // SIAM Journal on Algebraic and Discrete Methods. — 1980. — Т. 1, вип. 2. — С. 216–227. — DOI:10.1137/0601025.

Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista. Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers. — Springer, 2013. — Т. 7704. — С. 79–89. — (Lecture Notes in Computer Science) — DOI:10.1007/978-3-642-36763-2_8..

Thomas L. Saaty. The minimum number of intersections in complete graphs // Proceedings of the National Academy of Sciences of the United States of America. — 1964. — Т. 52. — С. 688–690. — DOI:10.1073/pnas.52.3.688..

T. A. J. Nicholson. Permutation procedure for minimising the number of crossings in a network // Proceedings of the Institution of Electrical Engineers. — 1968. — Т. 115. — С. 21–26. — DOI:10.1049/piee.1968.0004..

Miki Miyauchi. Topological book embedding of bipartite graphs // IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. — 2006. — Vol. E89-A, iss. 5. — P. 1223–1226. — DOI:10.1093/ietfec/e89-a.5.1223.

Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis. Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007, Proceedings. — Springer, 2007. — Т. 4835. — С. 172–183. — (Lecture Notes in Computer Science) — DOI:10.1007/978-3-540-77120-3_17..

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrt'o. Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94, Herrsching, Germany, June 16–18, 1994, Proceedings. — Springer, 1995. — Т. 903. — С. 256–268. — (Lecture Notes in Computer Science) — DOI:10.1007/3-540-59071-4_53..

Michael J. Bannister, David Eppstein, Joseph A. Simons. Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France, September 23–25, 2013, Revised Selected Papers. — 2013. — Т. 8242. — С. 340–351. — (Lecture Notes in Computer Science) — DOI:10.1007/978-3-319-03841-4_30..

Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet. Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers. — 2007. — Т. 4614. — С. 140–151. — (Lecture Notes in Computer Science) — DOI:10.1007/978-3-540-74450-4_13..

Peter Clote, Stefan Dobrev, Ivan Dotu, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia. On the page number of RNA secondary structures with pseudoknots // Journal of Mathematical Biology. — 2012. — Т. 65, вип. 6–7. — С. 1337–1357. — DOI:10.1007/s00285-011-0493-6..

A. Pavan, Raghunath Tewari, N. V. Vinodchandran. On the power of unambiguity in log-space // Computational Complexity. — 2012. — Т. 21, вип. 4. — С. 643–670. — DOI:10.1007/s00037-012-0047-3..

Zvi Galil, Ravi Kannan, Endre Szemerédi. On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines // Journal of Computer and System Sciences. — 1989. — Т. 38, вип. 1. — С. 134–149. — DOI:10.1016/0022-0000(89)90036-6..

Книжкове вкладення (Ukrainian Wikipedia)

archive.org

arxiv.org

combinatorics.org

doi.org

dx.doi.org

icm.edu.pl

matwbn.icm.edu.pl

lboro.ac.uk

dspace.lboro.ac.uk