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

Z(3)-connectivity of K-1,K-3-free graphs without induced cycle of length at least 5

认领
导出
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Li, Xiangwen*;Ma, Jianqing*
通讯作者:
Li, Xiangwen;Ma, Jianqing
作者机构:
[Li, XW; Ma, JQ; Ma, Jianqing; Li, Xiangwen] Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China.
通讯机构:
[Li, XW; Ma, JQ] H
Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
Z(3)-connectivity;K-1,K-3-free;nowhere-zero 3-flow
期刊:
ARS MATHEMATICA CONTEMPORANEA
ISSN:
1855-3966
年:
2016
卷:
11
期:
1
页码:
35-47
基金类别:
Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [11171129]; Doctoral Fund of Ministry of Education of ChinaMinistry of Education, China [20130144110001]
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学学院
摘要:
Jaeger et al. conjectured that every 5-edge-connected graph is Z(3)-connected. In this paper, we prove that every 4-edge-connected K-1,K-3-free graph without any induced cycle of length at least 5 is Z(3)-connected, which partially generalizes the earlier results of Lai [Graphs and Combin. 16 (2000) 165-176] and Fukunag...

反馈

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

成果认领

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

提示

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

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

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

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