Feng Liu

collaborators

3 papers

math.CO2025

Cycles and paths through vertices whose degrees are at least the bipartite-hole-number

Chengli Li, Feng Liu, Yurui Tang

The bipartite-hole-number of a graph $G$ , denoted by $α (G)$ , is the minimum integer $k$ such that there exist positive integers $s$ and $t$ with $s + t = k + 1$ , satisfyi…

math.CO2025

Trisimplicial vertices in (fork, odd parachute)-free graphs

Kaiyang Lan, Feng Liu, Di Wu +1

An {\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\em odd parachute} is a graph obtained from an odd hole $H$ by adding a new ed…

math.CO2024

Constructions of minimally $t$ -tough regular graphs

Kun Cheng, Chengli Li, Feng Liu

A non-complete graph $G$ is said to be $t$ -tough if for every vertex cut $S$ of $G$ , the ratio of $∣ S ∣$ to the number of components of $G - S$ is at least $t$ . The toughness $τ (G)$ o…

Cycles and paths through vertices whose degrees are at least the bipartite-hole-number

Trisimplicial vertices in (fork, odd parachute)-free graphs

Constructions of minimally t-tough regular graphs

Constructions of minimally $t$ -tough regular graphs