Feng Liu

activity

20242026

most citedLongest cycles and longest chordless cycles in

2

-connected graphs

1 citations · 1 across the 14 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

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…

math.CO2024★ 1 cited

Longest cycles and longest chordless cycles in $2$ -connected graphs

Yanan Hu, Chengli Li, Feng Liu

Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$ -connected graph has a chord. The circumference $c (G)$ and induced circumference $c^{'} (G)$ of a graph $…

math.CO2024

The minimum size and maximum diameter of an edge-pancyclic graph of a given order

Chengli Li, Feng Liu, Xingzhi Zhan

A $k$ -cycle in a graph is a cycle of length $k .$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3 \leq k \leq n,$ every edge of $G$ lies in a $k$ -cycl…

math.CO2024

Bound vertices of longest paths between two vertices in cubic graphs

Chengli Li, Feng Liu

Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$ -connected graph has a chord. This is one of the most important unsolved problems in graph theory. Le…

Constructions of minimally t-tough regular graphs

Longest cycles and longest chordless cycles in 2-connected graphs

The minimum size and maximum diameter of an edge-pancyclic graph of a given order

Bound vertices of longest paths between two vertices in cubic graphs

Constructions of minimally $t$ -tough regular graphs

Longest cycles and longest chordless cycles in $2$ -connected graphs