抑制 发表于 2025-3-30 09:55:20

The Argentine Surrealist Journalss 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.

humectant 发表于 2025-3-30 13:01:03

The Two Faces of Early Surrealism in Mexicoremains NP-complete even for box pleating, where creases form a subset of a square grid with diagonals. In addition, we provide new terminology to implicitly represent the global layer order of a flat folding, and present a new planar reduction framework for grid-aligned gadgets.

引导 发表于 2025-3-30 16:45:56

The Argentine Surrealist Journals 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.

变形 发表于 2025-3-30 22:28:28

Argentina’s Pioneer Surrealists-. 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 related to Tarski’s plank problem.

altruism 发表于 2025-3-31 01:23:55

https://doi.org/10.1007/978-94-010-1526-4the 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 ..

Silent-Ischemia 发表于 2025-3-31 05:27:10

http://reply.papertrans.cn/29/2812/281181/281181_56.png

Eviction 发表于 2025-3-31 10:16:50

Reversible Nets of Polyhedra,eral connected figures. It is shown that two nets obtained by cutting the surface of an arbitrary convex polyhedron along non-intersecting dissection trees are reversible. Moreover, a condition for two nets of an isotetrahedron to be both reversible and tessellative is given.

疲惫的老马 发表于 2025-3-31 16:17:49

http://reply.papertrans.cn/29/2812/281181/281181_58.png

Arteriography 发表于 2025-3-31 17:55:38

http://reply.papertrans.cn/29/2812/281181/281181_59.png

无节奏 发表于 2025-3-31 22:30:09

http://reply.papertrans.cn/29/2812/281181/281181_60.png
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Discrete and Computational Geometry and Graphs; 18th Japan Conferenc Jin Akiyama,Hiro Ito,Yushi Uno Conference proceedings 2016 Springer In