Lihua You

collaborators

4 papers

math.CO2026

An improved upper bound on the oriented diameter of graphs with diameter $4$

Jifu Lin, Xiaolin Wang, Lihua You

Let $f (d)$ be the smallest value for which every bridgeless graph $G$ with diameter $d$ admits a strong orientation $G$ such that the diameter of $\overrightarrow{…

math.CO2026

Rainbow panconnectivity in a graph collection

Menghan Ma, Lihua You, Xiaoxue Zhang

Let $G = {G_{1}, \dots, G_{n - 1}}$ be a collection of not necessarily distinct $n$ -vertex graphs with the same vertex set $V$ . A path $P$ with $V (P) \subseteq V$ and $|E(P)|\leq…

math.CO2026

Transversal and Hamiltonicity in a bipartite graph collection

Menghan Ma, Lihua You, Xiaoxue Zhang

Let $G = {G_{1}, \dots, G_{s}}$ be a collection of $s$ bipartite graphs with the same bipartition $V = (X, Y)$ . For a path $P$ with $V (P) = V$ and $∣ E (P) ∣ = s$ , if there exists an in…

math.CO2024

The existence of a ${P_{2}, C_{3}, P_{5}, T (3)}$ -factor based on the size or the $A_{I^} \pm$ -spectral radius of graphs

Xianglong Zhang, Lihua You

Let $G$ be a connected graph of order $n$ . A ${P_{2}, C_{3}, P_{5}, T (3)}$ -factor of $G$ is a spanning subgraph of $G$ such that each component is isomorphic to a member i…

An improved upper bound on the oriented diameter of graphs with diameter 4

Rainbow panconnectivity in a graph collection

Transversal and Hamiltonicity in a bipartite graph collection

The existence of a {P2​,C3​,P5​,T(3)}-factor based on the size or the AI^​±-spectral radius of graphs

An improved upper bound on the oriented diameter of graphs with diameter $4$

The existence of a ${P_{2}, C_{3}, P_{5}, T (3)}$ -factor based on the size or the $A_{I^} \pm$ -spectral radius of graphs