Miaomiao Han

activity

20162023

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

Square Coloring of Planar Graphs with Maximum Degree at Most Five

Jiani Zou, Miaomiao Han, Hong-Jian Lai

The \textit{square} of a graph $G$ , denoted by $G^{2}$ , is obtained from $G$ by adding an edge to connect every pair of vertices with a common neighbor in $G$ . In this paper we prove…

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.CO2016

Nowhere-zero $3$ -flow and $Z_{3}$ -connectedness in Graphs with Four Edge-disjoint Spanning Trees

Miaomiao Han, Hong-Jian Lai, Jiaao Li

Given a zero-sum function $β : V (G) \to Z_{3}$ with $\sum_{v \in V (G)} β (v) = 0$ , an orientation $D$ of $G$ with $d_{D}^{+} (v) - d_{D}^{-} (v) = β (v)$ in $Z_{3}$ for every ver…

Square Coloring of Planar Graphs with Maximum Degree at Most Five

Group Connectivity under 3-Edge-Connectivity

Nowhere-zero 3-flow and Z3​-connectedness in Graphs with Four Edge-disjoint Spanning Trees

Group Connectivity under $3$ -Edge-Connectivity

Nowhere-zero $3$ -flow and $Z_{3}$ -connectedness in Graphs with Four Edge-disjoint Spanning Trees