Rongxing Xu

activity

20172021

most citedMapping sparse signed graphs to

(K_{2 k}, M)

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

collaborators

4 papers

math.CO2021★ 3 cited

Mapping sparse signed graphs to $(K_{2 k}, M)$

Reza Naserasr, Riste Škrekovski, Zhouningxin Wang +1

A homomorphism of a signed graph $(G, σ)$ to $(H, π)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and th…

math.CO2020

The strong fractional choice number of $3$ -choice critical graphs

Rongxing Xu, Xuding Zhu

A graph $G$ is called $3$ -choice critical if $G$ is not $2$ -choosable but any proper subgraph is $2$ -choosable. A graph $G$ is strongly fractional $r$ -choosable if $G$ is $(a, b)$ -c…

math.CO2020

Multiple list colouring of $3$ -choice critical graphs

Rongxing Xu, Xuding Zhu

A graph $G$ is called $3$ -choice critical if $G$ is not $2$ -choosable but any proper subgraph is $2$ -choosable. A characterization of $3$ -choice critical graphs was given by Voigt…

math.CO2017

List colouring of graphs and generalized Dyck paths

Rongxing Xu, Yeong-Nan Yeh, Xuding Zhu

The Catalan numbers occur in various counting problems in combinatorics. This paper reveals a connection between the Catalan numbers and list colouring of graphs. Assume $G$ is a g…

Mapping sparse signed graphs to (K2k​,M)

The strong fractional choice number of 3-choice critical graphs

Multiple list colouring of 3-choice critical graphs

List colouring of graphs and generalized Dyck paths

Mapping sparse signed graphs to $(K_{2 k}, M)$

The strong fractional choice number of $3$ -choice critical graphs

Multiple list colouring of $3$ -choice critical graphs