18 citations · 176 across the 37 of their papers we have counts for
36 papers · 1 filter
Weak degeneracy of planar graphs without 4- and 6-cycles
Tao Wang
A graph is -degenerate if every subgraph has a vertex with . The class of degenerate graphs plays an important role in the graph coloring theory. Observ…
On odd colorings of sparse graphs
Tao Wang, Xiaojing Yang
An \emph{odd -coloring} of a graph is a proper -coloring such that each non-isolated vertex has a color appearing an odd number of times within its open neighborhood. A \emph…
Maximum odd induced subgraph of a graph concerning its chromatic number
Tao Wang, Baoyindureng Wu
Let be the maximum order of an odd induced subgraph of . In 1992, Scott proposed a conjecture that for a graph of order witho…
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…