Xuding Zhu

activity

20062012

most citedCircular chromatic index of graphs of maximum degree 3

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2012

Circular flow number of highly edge connected signed graphs

Xuding Zhu

This paper proves that for any positive integer $k$ , every essentially $(2 k + 1)$ -unbalanced $(12 k - 1)$ -edge connected signed graph has circular flow number at most $2 + \frac{1}{k}$ .

math.CO2011

Colouring Edges with many Colours in Cycles

Jaroslav Nesetril, Patrice Ossona De Mendez, Xuding Zhu

The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define th…

math.CO2006★ 17 cited

Circular chromatic index of graphs of maximum degree 3

Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3

This paper proves that if $G$ is a graph (parallel edges allowed) of maximum degree 3, then $χ_{c}^{'} (G) \leq 11/3$ provided that $G$ does not contain $H_{1}$ or $H_{2}$ as a subgraph, whe…