Titlebook: Computational Geometry and Graphs; Thailand-Japan Joint Jin Akiyama,Mikio Kano,Toshinori Sakai Conference proceedings 2013 Springer-Verlag

導(dǎo)彈

書目名稱Computational Geometry and Graphs影響因子(影響力)




書目名稱Computational Geometry and Graphs影響因子(影響力)學(xué)科排名




書目名稱Computational Geometry and Graphs網(wǎng)絡(luò)公開度




書目名稱Computational Geometry and Graphs網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computational Geometry and Graphs被引頻次




書目名稱Computational Geometry and Graphs被引頻次學(xué)科排名




書目名稱Computational Geometry and Graphs年度引用




書目名稱Computational Geometry and Graphs年度引用學(xué)科排名




書目名稱Computational Geometry and Graphs讀者反饋




書目名稱Computational Geometry and Graphs讀者反饋學(xué)科排名

法律的瑕疵

Colored Quadrangulations with Steiner Points, graph . with vertex set . such that the boundary of the unbounded face of . coincides with CH(.) and that each bounded face of . is quadrilateral, where CH(.) stands for the boundary of the convex hull of .. It is easily checked that in general not every .-colored . admits a .-colored quadrangulati

柔聲地說

On Universal Point Sets for Planar Graphs,rov, we show that there is no .-universal point set of size ., for any .?≥?15. Conversely, we use a computer program to show that there exist universal point sets for all .?≤?10 and to enumerate all corresponding order types. Finally, we describe a collection . of 7′393 planar graphs on 35 vertices

tenuous

On Non 3-Choosable Bipartite Graphs,que 3-list assignment . up to renaming the colors such that . . is not .-colorable. We present our strategies which can be applied to obtain another proof of their result. These strategies are invented to claim a stronger result that every complete bipartite graph with fifteen vertices except . . is

頭盔

Palate

On Complexity of Flooding Games on Graphs with Interval Representations,se games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider the coloring games on general graphs: Once a vertex is colored, the

Palate

,How to Generalize Janken – Rock-Paper-Scissors-King-Flea,ld. A variant of janken can be represented by a tournament, where a vertex corresponds a sign and an arc (.,.) means sign . defeats sign .. However, not all tournaments define useful janken variants, i.e., some janken variants may include a useless sign, which is strictly inferior than another sign

瘋狂

變色龍

,GDDs with Two Associate Classes and with Three Groups of Sizes 1, ,, , and ,,?

Pandemic

The Number of Diagonal Transformations in Quadrangulations on the Sphere, unique bipartition .(.)?=?.?∪?., where we call (|.|,|.|) the . of .. In this article, we shall prove that any two quadrangulations . and .′ with the same bipartition size can be transformed into each other by at most 10|.|?+?16|.|???64 diagonal slides.