Menghan Ma

collaborators

3 papers

math.CO2026

Connectivity keeping pendant extensions of paths in $k$ -connected graphs and triangle-free graphs

Menghan Ma, Qinghai Liu, Liping Zhang +1

Motivated by Mader's conjecture on connectivity keeping trees, we study trees obtained from paths by adding one pendant vertex, as well as related problems in triangle-free graphs.…

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…

Connectivity keeping pendant extensions of paths in k-connected graphs and triangle-free graphs

Rainbow panconnectivity in a graph collection

Transversal and Hamiltonicity in a bipartite graph collection

Connectivity keeping pendant extensions of paths in $k$ -connected graphs and triangle-free graphs