Xiaxia Guan

activity

20182025

collaborators

Showing 2018Show all

2 papers · 1 filter

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

Embedding 5-planar graphs in three pages

Xiaxia Guan, Weihua Yang

A \emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the pages so that no two edges on the same page intersect.…