The following pages link to Xuding Zhu (Q168189):
Displaying 50 items.
- Total weight choosability of cone graphs (Q293660) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Multiple list colouring of planar graphs (Q345127) (← links)
- Backbone coloring for graphs with large girths (Q385734) (← links)
- Anti-magic labeling of trees (Q397133) (← links)
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs (Q404440) (← links)
- Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
- Thue choosability of trees (Q411845) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- On-line 3-choosable planar graphs (Q424603) (← links)
- On-line list colouring of complete multipartite graphs (Q426807) (← links)
- Weighted-1-antimagic graphs of prime power order (Q432719) (← links)
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Maximum 4-degenerate subgraph of a planar graph (Q490312) (← links)
- The game Grundy indices of graphs (Q498433) (← links)
- Circular chromatic Ramsey number (Q501991) (← links)
- The wide-diameter of \(Z_{n, k}\) (Q505445) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- The surviving rate of an outerplanar graph for the firefighter problem (Q627197) (← links)
- Cycle adjacency of planar graphs and 3-colourability (Q647258) (← links)
- The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Distinguishing labeling of the actions of almost simple groups. (Q663093) (← links)
- The surviving rate of planar graphs (Q764317) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- A note on the Poljak-Rödl function (Q782938) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Circular total chromatic numbers of graphs (Q898151) (← links)
- Fractional Thue chromatic number of graphs (Q906448) (← links)
- Activation strategy for asymmetric marking games (Q925014) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- Circular consecutive choosability of graphs (Q947046) (← links)
- Rainbow domination on trees (Q968106) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- Total coloring of planar graphs of maximum degree eight (Q991795) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- Circular degree choosability (Q1010827) (← links)
- Distinguishing labeling of group actions (Q1024499) (← links)
