Zobrazeno 1 - 10
of 11 311
pro vyhledávání: '"Clockwise order"'
Autor:
Tomoki Nakamigawa
Publikováno v:
Ars Mathematica Contemporanea. 18:381-391
A chord diagram E is a set of chords of a circle such that no pair of chords has a common endvertex. Let v 1 , v 2 , …, v 2 n be a sequence of vertices arranged in clockwise order along a circumference. A chord diagram { v 1 v n + 1 , v 2 v n + 2 ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b117997a42f686646ea69a315587379a
https://doi.org/10.26493/1855-3974.2239.7f1
https://doi.org/10.26493/1855-3974.2239.7f1
Publikováno v:
IDC (Extended Abstracts)
How do children plan their drawing on a touchscreen? Studies have shown that children follow a certain graphic rules and routine in their drawing. We are at the start of investigating how children of different ages plan their drawing strategies on a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::985863c63142d18a276fe19d98a6dd9a
https://doi.org/10.1145/3397617.3397844
https://doi.org/10.1145/3397617.3397844
Publikováno v:
Electronic Notes in Discrete Mathematics, 68, 227-232. Elsevier
Electronic Notes in Discrete Mathematics, 68, 227-232
Electronic Notes in Discrete Mathematics, 68, 227-232
Let n and k be positive integers with n ≥ 2 k . Consider a circle C with n points 1 , … , n in clockwise order. The interlacing graph IG n , k is the graph with vertices corresponding to k-subsets of [n] that do not contain two adjacent points on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7238bea8e27ae898abc45ecb0c2aa4b
https://doi.org/10.1016/j.endm.2018.06.039
https://doi.org/10.1016/j.endm.2018.06.039
Autor:
Panholzer, Thomas, Mauricio, Rufino
Publikováno v:
Place Names of Pohnpei Island; 2003, preceding p1, 1/9p
Publikováno v:
International Journal of Theoretical Physics; Jun2024, Vol. 63 Issue 6, p1-15, 15p
Autor:
Asaf Nachmias
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783030279677
In this chapter we discuss countably infinite connected simple graphs that are locally finite , that is, the vertex degrees are finite. In a similar fashion to the previous chapter, an infinite planar graph is a connected infinite graph such that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cba0980f22757cd123629a3c9036175
https://doi.org/10.1007/978-3-030-27968-4_4
https://doi.org/10.1007/978-3-030-27968-4_4
Autor:
Mikael Olsson
Publikováno v:
CSS3 Quick Syntax Reference ISBN: 9781484249024
CSS Quick Syntax Reference Guide ISBN: 9781430264903
CSS Quick Syntax Reference Guide ISBN: 9781430264903
Margins and padding are used to adjust the position of an element and to create space around it.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25d0c72e4bbdd0b94322339ea25e389a
https://doi.org/10.1007/978-1-4842-4903-1_19
https://doi.org/10.1007/978-1-4842-4903-1_19
Autor:
Baba, Marius Nicolae
Publikováno v:
Mechanics Based Design of Structures & Machines; 2024, Vol. 52 Issue 12, p10073-10097, 25p
Autor:
Martin Derka, Therese C. Biedl
Publikováno v:
SOFSEM 2017: Theory and Practice of Computer Science ISBN: 9783319519623
SOFSEM
SOFSEM
This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex v is the same as the order of edges in the clockwise order around v in the planar em
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fd22db9d1bf2be022022c81a448c06e
https://doi.org/10.1007/978-3-319-51963-0_22
https://doi.org/10.1007/978-3-319-51963-0_22
Autor:
Thilikos, Dimitrios M.1 (AUTHOR) sedthilk@thilikos.info, Wiederrecht, Sebastian2 (AUTHOR) sebastian.wiederrecht@gmail.com
Publikováno v:
Journal of the ACM. Aug2024, Vol. 71 Issue 4, p1-56. 56p.