Fan Yang

activity

20132022

most citedFlexibility of planar graphs without

C_{4}

and

C_{5}

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

collaborators

11 papers

math.CO2022★ 1 cited

A note on the edge choosability of $K_{5}$ -minor free graphs

Jieru Feng, Jianliang Wu, Fan Yang

For a planar graph $G$ , Borodin stated that $G$ is $(Δ + 1)$ -edge-choosable if $Δ \geq 9$ and later Bonamy showed that $G$ is $9$ -edge-choosable if $Δ = 8$ . At the same time, Borodin et…

math.CO2022

On sufficient conditions for planar graphs to be 5-flexible

Fan Yang

In this paper, we study the flexibility of two planar graph classes $H_{1}$ , $H_{2}$ , where $H_{1}$ , $H_{2}$ denote the set of all hopper-free plana…

math.CO2021

The total coloring of $K_{5}$ -minor-free graphs

Fan Yang, Jianliang Wu

A total $k$ -coloring of a graph $G$ is a coloring of $V (G) \cup E (G)$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic num…

math.CO2021

On the size of $(K_{t}, K_{1, k})$ -co-critical graphs

Hunter Davenport, Zi-Xia Song, Fan Yang

Given graphs $G, H_{1}, H_{2}$ , we write $G \to (H_{1}, H_{2})$ if every ${$ red, blue $}$ -coloring of the edges of $G$ contains a red copy of $H_{1}$ or a blue copy of $H_{2}$ . A no…

math.CO2020★ 2 cited

Flexibility of planar graphs without $C_{4}$ and $C_{5}$

Donglei Yang, Fan Yang

Let $G$ be a ${C_{4}, C_{5}}$ -free planar graph with a list assignment $L$ . Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least…

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

Best and worst case permutations for random online domination of the path

Christopher Coscia, Jonathan DeWitt, Fan Yang +1

We study a randomized algorithm for graph domination, by which, according to a uniformly chosen permutation, vertices are revealed and added to the dominating set if not already do…

math.CO2015★ 1 cited

Nowhere-zero 9-flows in 3-edge-connected signed graphs

Fan Yang, Sanming Zhou

A signed graph is a graph with a positive or negative sign on each edge. Regarding each edge as two half edges, an orientation of a signed graph is an assignment of a direction to…

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

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.CO2013

A neighborhood condition for fractional ID-[a,b]-factor-critical graphs

Sizhong Zhou, Fan Yang, Zhiren Sun

Let $G$ be a graph of order $n$ , and let $a$ and $b$ be two integers with $1 \leq a \leq b$ . Let $h : E (G) \to [0, 1]$ be a function. If $a \leq \sum_{e ∋ x} h (e) \leq b$ holds for…

A note on the edge choosability of K5​-minor free graphs