Xiangwen Li

most citedZ3-connectivity with independent number 2

2 citations · 5 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2014★ 2 cited

Z3-connectivity with independent number 2

Fan Yang, Xiangwen Li, Liangchen Li

Let G be a 3-edge-connected graph on n vertices. It is proved in this paper that if the number of independent set no more than 2, then either G can be Z3-contracted to one of graph…

math.CO2014★ 1 cited

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable

Runrun Liu, Xiangwen Li, Gexin Yu

A $(c_{1}, c_{2}, ..., c_{k})$ -coloring of $G$ is a mapping $φ : V (G) \mapsto {1, 2, ..., k}$ such that for every $i, 1 \leq i \leq k$ , $G [V_{i}]$ has maximum degree at most $c_{i}$ , where $G [V_{i}]$ d…

math.CO2014★ 1 cited

Realizing degree sequences as $Z_{3}$ -connected graphs

Fan Yang, Xiangwen Li, Hong -Jian Lai

An integer-valued sequence $π = (d_{1}, \dots, d_{n})$ is {\em graphic} if there is a simple graph $G$ with degree sequence of $π$ . We say the $π$ has a realization $G$ . Let $Z_{3}$ be a…

math.CO2014★ 1 cited

A relaxation of the Bordeaux Conjecture

Runrun Liu, Xiangwen Li, Gexin Yu

Z3-connectivity with independent number 2

Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable

Realizing degree sequences as Z3​-connected graphs

A relaxation of the Bordeaux Conjecture

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable

Realizing degree sequences as $Z_{3}$ -connected graphs