331 citations
- University of Chinese Academy of SciencesCN253 papers
- Tsinghua UniversityCN243 papers
- University of ManchesterGB241 papers
- University of OxfordGB240 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT239 papers
- Uppsala UniversitySE238 papers
- Zhengzhou UniversityCN217 papers
- Peking UniversityCN213 papers
- Nanjing UniversityCN209 papers
- University of Science and Technology of ChinaCN208 papers
- Shandong UniversityCN205 papers
- Shanghai Jiao Tong UniversityCN203 papers
Showing 2021 · math.COShow all
3 papers · 2 filters
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★ 2 cited
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…
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…