Titlebook: Discrete and Computational Geometry and Graphs; 18th Japan Conferenc Jin Akiyama,Hiro Ito,Yushi Uno Conference proceedings 2016 Springer In

畏縮

,-Labeling of a Cycle with One Chord,s defined as .The maximum value of a .-labeling of . is defined as .while the minimum value of a .-labeling of . is .In this paper, we determine the maximum and minimum values of a .-labeling of a graph derived from cycle with adding one chord.

吹牛者

勤勞

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces, their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant.

看法等

Simultaneous Approximation of Polynomials,-. if there exist . such that for every polynomial . there exists an index . with . We settle a problem of Makai and Pach (1983) by showing that . is .-controlling if and only if . is divergent. The proof is based on a statement about covering the Euclidean space with translates of slabs, which is r

genuine

Distance Geometry on the Sphere,tance between two realized vertices incident to a same edge is equal to the given edge weight. In this paper we look at the setting where the target space is the surface of the sphere .. We show that the Distance Geometry Problem is almost the same in this setting, as long as the distances are Eucli

開(kāi)花期女

The Sigma Chromatic Number of the Circulant Graphs ,, ,, and ,,the vertices adjacent to .. If . for every two adjacent ., then . is called a . of .. The minimum number of colors required in a sigma coloring of . is called its . and is denoted by .. In this paper, we determine the sigma chromatic numbers of three families of circulant graphs: ., ., and ..

時(shí)間等

https://doi.org/10.1007/978-3-030-90099-1n squared Horton sets of size .. Improving on previous upper and lower bounds we show that this number is ., which constitutes the currently best upper bound on minimizing the number of general 4-holes for any set of . points in the plane..To obtain the improved bounds, we prove a result of independ

蟄伏

Bone. The Foundation of a Smileed into four pieces, then hinged like a chain, and then is transformed into a square by rotating the hinged pieces. Furthermore, the entire boundary of each figure goes into the inside of the other figure and becomes the dissection lines of the other figure. Many intriguing results on reversibilitie

后退

https://doi.org/10.1007/978-3-030-40268-6e plane, which are sorted according to their .-coordinates, we show how to test in . time if . piercing points placed on two lines, parallel to the .-axis, can pierce all the disks of different radii centered at the . given points. This leads to an . time algorithm for the weighted .-center problem.

合法