Z. Miao

collaborators

3 papers

math.CO2021

On the size of special class 1 graphs and $(P_{3}; k)$ -co-critical graphs

Gang Chen, Zhengke Miao, Zi-Xia Song +1

A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $Δ$ , then the chromatic index $χ^{'} (G)$ of $G$ is $Δ$ or $Δ + 1$ . A graph $G$ is class 1 if $χ'(…

math.CO2021

List star edge coloring of generalized Halin graphs

Zhengke Miao, Yimin Song, Tao Wang +1

A star $k$ -edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star $k$ -edge…

math.CO2009

Identifying codes and locating-dominating sets on paths and cycles

Chunxia Chen, Changhong Lu, Zhengke Miao

Let $G = (V, E)$ be a graph and let $r \geq 1$ be an integer. For a set $D \subseteq V$ , define $N_{r} [x] = {y \in V : d (x, y) \leq r}$ and $D_{r} (x) = N_{r} [x] \cap D$ , where $d (x, y)$ denot…

On the size of special class 1 graphs and (P3​;k)-co-critical graphs

List star edge coloring of generalized Halin graphs

Identifying codes and locating-dominating sets on paths and cycles

On the size of special class 1 graphs and $(P_{3}; k)$ -co-critical graphs