Fuyuan Chen

most citedSufficient conditions for graphs to be

k

-connected, maximally connected and super-connected

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

collaborators

3 papers

math.CO2017★ 2 cited

Sufficient conditions for graphs to be $k$ -connected, maximally connected and super-connected

Zhen-Mu Hong, Zheng-Jiang Xia, Fuyuan Chen +1

Let $G$ be a connected graph with minimum degree $δ (G)$ and vertex-connectivity $κ (G)$ . The graph $G$ is $k$ -connected if $κ (G) \geq k$ , maximally connected if $κ (G) = δ (G)$ , and su…

math.CO2017★ 1 cited

Pebbling on Jahangir graphs

Zheng-Jiang Xia, Zhen-Mu Hong, Fu-Yuan Chen

The pebbling number of a graph $G$ , $f (G)$ , is the least $p$ such that, however $p$ pebbles are placed on the vertices of $G$ , we can move a pebble to any vertex by a sequence of m…

math.CO2014

A note on nowhere-zero 3-flow and Z_3-connectivity

Fuyuan Chen, Bo Ning

There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conject…

Sufficient conditions for graphs to be k-connected, maximally connected and super-connected

Pebbling on Jahangir graphs

A note on nowhere-zero 3-flow and Z_3-connectivity

Sufficient conditions for graphs to be $k$ -connected, maximally connected and super-connected