Maximum average degree of list-edge-critical graphs and Vizing's conjecture

被引：0

作者：

Harrelson, Joshua ^{[1
]}

Reavis, Hannah ^{[2
]}

机构：

[1] Middle Georgia State Univ, Fac Math & Stat, Macon, GA 31206 USA

[2] Middle Georgia State Univ, Dept Math & Stat, Macon, GA USA

来源：

ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS | 2022年 / 10卷 / 02期

关键词：

list-edge-coloring; maximum average degree; discharging; TOTAL COLORINGS; PLANAR GRAPHS;

D O I：

10.5614/ejgta.2022.10.2.4

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Vizing conjectured that X '(l) (G) <= Delta + 1 for all graphs. For a graph G and nonnegative integer k, we say G is a k-list-edge-critical graph if X '(l) (G) > k, but X '(l) (G- e) <= k for all e. E(G). We use known results for list-edge-critical graphs to verify Vizing's conjecture for G with mad(G) <Delta+3/2 and Delta <= 9.

引用

页码：385 / 392

页数：8

共 50 条

[41] Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three*
Béla Csaba†‡
Ali Shokoufandeh‡
Endre Szemerédi
Combinatorica, 2003, 23 : 35 - 72
[42] Gallai's path decomposition conjecture for graphs of small maximum degree
Bonamy, Marthe
Perrett, Thomas J.
DISCRETE MATHEMATICS, 2019, 342 (05) : 1293 - 1299
[43] On the size of edge-coloring critical graphs with maximum degree 4
Miao, Lianying
Pang, Shiyou
DISCRETE MATHEMATICS, 2008, 308 (23) : 5856 - 5859
[44] A better lower bound on the average degree of online k-list-critical graphs
Rabern, Landon
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
[45] Improper choosability of graphs and maximum average degree
Havet, F
Sereni, JS
JOURNAL OF GRAPH THEORY, 2006, 52 (03) : 181 - 199
[46] Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
Weifan Wang
Yiqiao Wang
Journal of Combinatorial Optimization, 2010, 19 : 471 - 485
[47] Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
Wang, Weifan
Wang, Yiqiao
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 19 (04) : 471 - 485
[48] Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
Department of Mathematics, Zhejiang Normal University, Zhejiang, Jinhua 321004, China
J Combin Optim, 4 (471-485):
[49] Efficient domination in directed tori and the Vizing's conjecture for directed graphs
Niepel, Ludovit
Cerny, Anton
AlBdaiwi, Bader
ARS COMBINATORIA, 2009, 91 : 411 - 422
[50] The incidence coloring conjecture for graphs of maximum degree 3
Maydanskiy, M
DISCRETE MATHEMATICS, 2005, 292 (1-3) : 131 - 141

← 1 2 3 4 5 →