8 citations · 11 across the 2 of their papers we have counts for
2 papers
math.CO2021★ 3 cited
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…
math.CO2021★ 8 cited
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…