1 citations · 1 across the 14 of their papers we have counts for
6 papers · 1 filter
Every fork-free graph is perfectly weight divisible
Feng Liu, Shuang Sun, Yan Wang +2
A graph is \emph{perfectly weight divisible} if, for every positive integral weight function on and every induced subgraph of with at least one edge, the vertex…
Optimal coloring of -free graphs with no short odd holes
Feng Liu, Shuang Sun, Yan Wang
A \emph{hole} is an induced cycle of length at least four, and an \emph{even hole} is a hole of even length. A \emph{cap} is obtained from a hole by adding a vertex adjacent to exa…
Edge-disjoint Hamilton cycles under a bipartite-hole condition
Yanan Hu, Chengli Li, Feng Liu
In 2017, McDiarmid and Yolov introduced the bipartite-hole-number and proved that forces a Hamilton cycle. They also gave a sufficient con…
Tight Bound for Nikiforov's Spectral Even-Cycle Conjecture
Peiru Kuang, Feng Liu, Shuang Sun +2
Nikiforov conjectured that, for every fixed and all sufficiently large , the unique -vertex -free graph with maximum adjacency spectral radius is $S^+_{n,k}…
On the structures of {diamond, bowtie}-free graphs that do not contain an induced subdivision of
Feng Liu, Shuang Sun, Yan Wang
A graph is -free if it contains no induced subdivision of . Lévêque et al. [\emph{J. Combin. Theory Ser. B} \textbf{102} (2012) 924--947] conjectured that all…
On the Borodin--Kostochka conjecture for graphs with large maximum degree
Feng Liu, Shuang Sun, Yan Wang +1
The Borodin--Kostochka conjecture states that every graph with maximum degree satisfies . In this paper, we verify this conjecture for…