找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
樓主: 使醉
51#
發(fā)表于 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.
52#
發(fā)表于 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.
53#
發(fā)表于 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.
54#
發(fā)表于 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.
55#
發(fā)表于 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 ..
56#
發(fā)表于 2025-3-31 05:27:10 | 只看該作者
57#
發(fā)表于 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.
58#
發(fā)表于 2025-3-31 16:17:49 | 只看該作者
59#
發(fā)表于 2025-3-31 17:55:38 | 只看該作者
60#
發(fā)表于 2025-3-31 22:30:09 | 只看該作者
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 00:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
油尖旺区| 麻栗坡县| 云安县| 民乐县| 华安县| 鱼台县| 盘山县| 长治市| 荆州市| 乐山市| 通化县| 京山县| 监利县| 南康市| 博罗县| 陆良县| 宜兰县| 荃湾区| 香格里拉县| 武川县| 建宁县| 周宁县| 江达县| 同心县| 奉化市| 宁南县| 锦州市| 义马市| 乌审旗| 雅江县| 资兴市| 扎赉特旗| 顺昌县| 南通市| 陇南市| 闽清县| 犍为县| 黑水县| 青铜峡市| 偏关县| 葵青区|