18 citations · 176 across the 37 of their papers we have counts for
5 papers · 1 filter
An extension of Thomassen's result on choosability
Lingxi Li, Tao Wang
Thomassen proved that all planar graphs are -choosable. Škrekovski strengthened the result by showing that all -minor-free graphs are -choosable. Dvořák and Postle poi…
Relaxed DP-3-coloring of planar graphs without some cycles
Huihui Fang, Tao Wang
Dvořák and Postle introduced the concept of DP-coloring to overcome some difficulties in list coloring. Sittitrai and Nakprasit combined DP-coloring and defective list coloring to…
Decomposition of planar graphs with forbidden configurations
Lingxi Li, Huajing Lu, Tao Wang +1
A -decomposition of a graph is an ordered pair such that is a subgraph of of maximum degree at most and is an acyclic orientation of wi…
Graphs with nonnegative Ricci curvature and maximum degree at most 3
Fengwen Han, Tao Wang
In this paper, we classify graphs with nonnegative Lin-Lu-Yau-Ollivier Ricci curvature, maximum degree at most 3 and diameter at least 6.
List star edge coloring of generalized Halin graphs
Zhengke Miao, Yimin Song, Tao Wang +1
A star -edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer such that admits a star -edge…