Lina Xue

collaborators

2 papers

math.CO2018

Minimum degree and size conditions for the proper connection number of graphs

Xiaxia Guan, Lina Xue, Eddie Cheng +1

An edge-coloured graph $G$ is called $p r o p er l y$ $co nn ec t e d$ if every two vertices are connected by a proper path. The $p r o p er$ $co nn ec t i o n$ $n u mb er$ of a connected graph $G$ , denot…

math.CO2017

On the number of proper paths between vertices in edge-colored hypercubes

Lina Xue, Weihua Yang, Shurong Zhang

Given an integer $1 \leq j < n$ , define the $(j)$ -coloring of a $n$ -dimensional hypercube $H_{n}$ to be the $2$ -coloring of the edges of $H_{n}$ in which all edges in dimension $i$ ,…