Yurui Tang

activity

20242026

collaborators

6 papers

math.CO2026

Weakly pancyclic vertices in dense nonbipartite graphs

Yurui Tang, Xingzhi Zhan

Let $G$ be a graph of girth $g$ and circumference $c .$ A vertex $v$ of $G$ is called weakly pancyclic if $v$ lies on an $ℓ$ -cycle for every integer $ℓ$ with $g \leq ℓ \leq c .$ …

math.CO2025

Extending two results on hamiltonian graphs involving the bipartite-hole-number

Kun Cheng, Yurui Tang

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

math.CO2025

The circumference of a graph with given minimum degree and clique number

Na Chen, Yurui Tang

The circumference denoted by $c (G)$ of a graph $G$ is the length of its longest cycle. Let $δ (G)$ and $ω (G)$ denote the minimum degree and the clique number of a graph $G$ , respect…

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

The minimum size of a $k$ -connected locally nonforesty graph

Chengli Li, Yurui Tang, Xingzhi Zhan

A local subgraph of a graph is the subgraph induced by the neighborhood of a vertex. Thus a graph of order $n$ has $n$ local subgraphs. A graph $G$ is called locally nonforesty if…

math.CO2024

Sparse graphs with an independent or foresty minimum vertex cut

Kun Cheng, Yurui Tang, Xingzhi Zhan

A connected graph is called fragile if it contains an independent vertex cut. In 2002 Chen and Yu proved that every connected graph of order $n$ and size at most $2 n - 4$ is fragile,…

Weakly pancyclic vertices in dense nonbipartite graphs

Extending two results on hamiltonian graphs involving the bipartite-hole-number

The circumference of a graph with given minimum degree and clique number

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

The minimum size of a k-connected locally nonforesty graph

Sparse graphs with an independent or foresty minimum vertex cut

The minimum size of a $k$ -connected locally nonforesty graph