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

Average degrees of edge-chromatic critical graphs

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Cao, Yan;Chen, Guantao;Jiang, Suyun*;Liu, Huiqing;Lu, Fuliang
通讯作者:
Jiang, Suyun
作者机构:
[Cao, Yan; Chen, Guantao] Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 USA.
[Chen, Guantao] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Jiang, Suyun] Jianghan Univ, Inst Interdisciplinary Res, Wuhan 430056, Hubei, Peoples R China.
[Jiang, Suyun] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
[Liu, Huiqing] Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Hubei, Peoples R China.
通讯机构:
[Jiang, Suyun] J
[Jiang, Suyun] S
Jianghan Univ, Inst Interdisciplinary Res, Wuhan 430056, Hubei, Peoples R China.
Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China.
语种:
英文
关键词:
Edge- k-coloring;k;Edge-critical graphs;Vizing’s adjacency lemma
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2019
卷:
342
期:
6
页码:
1613-1623
基金类别:
NSFC, ChinaNational Natural Science Foundation of China (NSFC) [11871239, 11671232, 61501208, 11571096, 61373019, 11671186]
机构署名:
本校为其他机构
院系归属:
数学与统计学学院
摘要:
Let G be a simple graph, and let Δ(G), d¯(G) and χ ′ (G) denote the maximum degree, the average degree and the chromatic index of G, respectively. We called G edge-Δ-critical if χ ′ (G)=Δ(G)+1 and χ ′ (H)≤Δ(G) for every proper subgraph H of G. Vizing in 1968 conjectured that if G is an edge-Δ-critical graph of order n, then d¯(G)≥Δ(G)−1+[Formula presented]. We prove that for any edge-Δ-critical graph G, d̄(G)≥min[Formula presented],[Formula presented]−2, that is, d¯(G)≥[Formula presented]Δ(G)−2ifΔ(G)≤75;[Formula prese...

反馈

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

成果认领

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

提示

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

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

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

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