找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Geometry and Graph Theory; Indonesia-Japan Join Jin Akiyama,Edy Tri Baskoro,Mikio Kano Conference proceedings 2005 Springer-V

[复制链接]
查看: 10044|回复: 60
发表于 2025-3-21 16:08:56 | 显示全部楼层 |阅读模式
书目名称Combinatorial Geometry and Graph Theory
副标题Indonesia-Japan Join
编辑Jin Akiyama,Edy Tri Baskoro,Mikio Kano
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Geometry and Graph Theory; Indonesia-Japan Join Jin Akiyama,Edy Tri Baskoro,Mikio Kano Conference proceedings 2005 Springer-V
出版日期Conference proceedings 2005
关键词Graph; Graph theory; Hamiltonian cycle; Matching; algorithmic geometry; combinatorial optimization; comput
版次1
doihttps://doi.org/10.1007/b105263
isbn_softcover978-3-540-24401-1
isbn_ebook978-3-540-30540-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2005
The information of publication is updating

书目名称Combinatorial Geometry and Graph Theory影响因子(影响力)




书目名称Combinatorial Geometry and Graph Theory影响因子(影响力)学科排名




书目名称Combinatorial Geometry and Graph Theory网络公开度




书目名称Combinatorial Geometry and Graph Theory网络公开度学科排名




书目名称Combinatorial Geometry and Graph Theory被引频次




书目名称Combinatorial Geometry and Graph Theory被引频次学科排名




书目名称Combinatorial Geometry and Graph Theory年度引用




书目名称Combinatorial Geometry and Graph Theory年度引用学科排名




书目名称Combinatorial Geometry and Graph Theory读者反馈




书目名称Combinatorial Geometry and Graph Theory读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:24:23 | 显示全部楼层
发表于 2025-3-22 04:07:13 | 显示全部楼层
Theoretische Grundlagen zur Methode,We give an algebraic characterization of all convex polygons that are 2-flat foldable to a square, that is, we determine all shapes of convex developments of a doubly-covered square.
发表于 2025-3-22 06:34:09 | 显示全部楼层
Krishan Mistry,Michael H. AlexanderLet . ≥ 7. Then there exists a uniform covering of 2-paths with 6-paths in . . if and only if . ≡ 0,1,2 (mod 5).
发表于 2025-3-22 08:45:36 | 显示全部楼层
发表于 2025-3-22 13:58:12 | 显示全部楼层
https://doi.org/10.1007/978-3-030-13279-8The . of a graph . is the minimum number of edges in . whose removal results in a planar graph. In this paper, we show that the skewness of the generalized Petersen graph . (3., .) is ., where . ≥ 4. As a byproduct, it is shown that for . ≥ 4, ., where . (.) denotes the crossing number of ..
发表于 2025-3-22 19:00:19 | 显示全部楼层
发表于 2025-3-23 01:07:25 | 显示全部楼层
发表于 2025-3-23 02:32:21 | 显示全部楼层
发表于 2025-3-23 09:11:51 | 显示全部楼层
Pathogenesis of Merkel Cell CarcinomaFor a graph ., a subset . ⊆ .(.), is said to be a . of . if if . ∖ . is acyclic. The cardinality of smallest decycling set of . is called the . of . and it is denoted by .(.)..Bau and Beineke posed the following problems: Which cubic graphs . with | . | = 2. satisfy .? In this paper, we give an answer to this problem.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-30 18:42
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表