Meiling Wang

most citedComplementary Graphs with Flows Less Than Three

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

collaborators

3 papers

math.CO2020

Group Connectivity under $3$ -Edge-Connectivity

Miaomiao Han, Jiaao Li, Xueliang Li +1

Let $S, T$ be two distinct finite Abelian groups with $∣ S ∣ = ∣ T ∣$ . A fundamental theorem of Tutte shows that a graph admits a nowhere-zero $S$ -flow if and only if it admits a nowhere-…

math.CO2019

Spanning Triangle-trees and Flows of Graphs

Jiaao Li, Xueliang Li, Meiling Wang

In this paper we study the flow-property of graphs containing a spanning triangle-tree. Our main results provide a structure characterization of graphs with a spanning triangle-tre…

math.CO2019★ 1 cited

Complementary Graphs with Flows Less Than Three

Jiaao Li, Xueliang Li, Meiling Wang

X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph $G$ with $∣ V (G) ∣ \geq 44$ , if $min {δ (G), δ (G^{c})} \geq 4$ , then either $G$ …

Group Connectivity under 3-Edge-Connectivity

Spanning Triangle-trees and Flows of Graphs

Complementary Graphs with Flows Less Than Three

Group Connectivity under $3$ -Edge-Connectivity