版权说明 操作指南
首页 > 成果 > 详情

Four Forbidden Subgraph Pairs for Hamiltonicity of 3-connected Graphs

认领
导出
Link by 中国知网学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Lin, Hou-yuan*;Hu, Zhi-quan*
通讯作者:
Lin, Hou-yuan;Hu, Zhi-quan
作者机构:
[Lin, Hou-yuan] Shandong Univ Finance & Econ, Sch Math & Quantitat Econ, Jinan 250014, Peoples R China.
[Hu, Zhi-quan] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.
通讯机构:
[Lin, Hou-yuan] S
[Hu, Zhi-quan] C
Shandong Univ Finance & Econ, Sch Math & Quantitat Econ, Jinan 250014, Peoples R China.
Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
hamiltonian cycle;forbidden subgraphs;claw-free graphs;closure
期刊:
应用数学学报:英文版
ISSN:
0168-9673
年:
2016
卷:
32
期:
2
页码:
469-476
基金类别:
National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [11371162, 11271149]; Shandong Province Higher Educational Science and Technology Program [J15LI52]; Science and Technology Development Project of Shandong Province [2014GGX101033]
机构署名:
本校为通讯机构
院系归属:
数学与统计学学院
摘要:
For non-negative integers i, j and k, we denote the generalized net as N_(i,j,k), which is a triangle with disjoint paths of length i, j and k, attached to distinct vertices of the triangle. In this paper, we prove that every 3-connected {K_(1,3),N_(8–i,i,1)}-free gra...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com