14 results on '"YIQIAO WANG"'
Search Results
2. A sufficient condition for a graph to be fractional (k,n)-critical.
3. On critical graphs for the chromatic edge-stability number.
4. Two sufficient conditions for a planar graph to be list vertex-2-arborable.
5. A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.
6. A note on the list vertex arboricity of toroidal graphs.
7. A note on the linear 2-arboricity of planar graphs.
8. Acyclic coloring of IC-planar graphs.
9. Adjacent vertex distinguishing colorings by sum of sparse graphs.
10. Plane graphs with maximum degree 9 are entirely 11-choosable.
11. An improved upper bound on the linear 2-arboricity of planar graphs.
12. Some bounds on the neighbor-distinguishing index of graphs.
13. The edge-face choosability of plane graphs with maximum degree at least 9.
14. Acyclic list edge coloring of outerplanar graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.