Xiangwen Li

activity

20132018

most citedZ3-connectivity with independent number 2

2 citations · 7 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2018★ 1 cited

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Runrun Liu, Xiangwen Li

Wang and Lih in 2002 conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to…

math.CO2018

Every planar graph without adjacent cycles of length at most $8$ is $3$ -choosable

Runrun Liu, Xiangwen Li

DP-coloring as a generalization of list coloring was introduced by Dvořák and Postle in 2017, who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which wa…

math.CO2016

Zero-sum 6-flows in 5-regular graphs

Fan Yang, Xiangwen Li

Let $G$ be a graph. A zero-sum flow of $G$ is an assignment of non-zero real numbers to the edges of $G$ such that the sum of the values of all edges incident with each vertex is z…

math.CO2015

A relaxation of the strong Bordeaux Conjecture

Ziwen Huang, Xiangwen Li, Gexin Yu

Let $c_{1}, c_{2}, \dots, c_{k}$ be $k$ non-negative integers. A graph $G$ is $(c_{1}, c_{2}, \dots, c_{k})$ -colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, \ldots, V_…

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

math.CO2013★ 1 cited

Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms

Xiangwen Li, Sanming Zhou

Tutte's 3-flow conjecture asserts that every 4-edge-connected graph has a nowhere-zero 3-flow. In this note we prove that every regular graph of valency at least four admitting a s…

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Every planar graph without adjacent cycles of length at most 8 is 3-choosable

Zero-sum 6-flows in 5-regular graphs

A relaxation of the strong Bordeaux Conjecture

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

Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms

Every planar graph without adjacent cycles of length at most $8$ is $3$ -choosable

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

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