The following pages link to Xuding Zhu (Q168189):
Displayed 50 items.
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Circular game chromatic number of graphs (Q1043981) (← links)
- Game colouring of the square of graphs (Q1043984) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
- Adaptable choosability of planar graphs with sparse short cycles (Q1045097) (← links)
- An approach on fixed pansystems theorems: panchaos and strange panattractor (Q1106521) (← links)
- Graphs whose circular chromatic number equals the chromatic number (Q1125613) (← links)
- Pattern periodic coloring of distance graphs (Q1127883) (← links)
- A simple proof of the multiplicativity of directed cycles of prime power length (Q1193732) (← links)
- Multiplicative posets (Q1198481) (← links)
- Circular chromatic numbers and fractional chromatic numbers of distance graphs (Q1266350) (← links)
- Minimal oriented graphs of diameter 2 (Q1272532) (← links)
- Multiplicativity of acyclic local tournaments (Q1276271) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- The game coloring number of planar graphs (Q1305532) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Mutiplicativity of oriented cycles (Q1322018) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- The circular chromatic number of series-parallel graphs of large odd girth (Q1348125) (← links)
- The level of nonmultiplicativity of graphs (Q1349114) (← links)
- The chromatic numbers of distance graphs (Q1356742) (← links)
- A survey on Hedetniemi's conjecture (Q1387740) (← links)
- Relaxed coloring of a graph (Q1393026) (← links)
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- Coloring the square of a \(K_{4}\)-minor free graph (Q1402088) (← links)
- An analogue of Hajós' theorem for the circular chromatic number. II (Q1409583) (← links)
- 4-colorable 6-regular toroidal graphs. (Q1417583) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- Chromatic Ramsey numbers (Q1584391) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- On Hedetniemi's conjecture and the colour template scheme (Q1613520) (← links)
- Tight relation between the circular chromatic number and the girth of series-parallel graphs (Q1613554) (← links)
- Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- The Alon-Tarsi number of planar graphs (Q1633764) (← links)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- Total list weighting of graphs with bounded maximum average degree (Q1660242) (← links)
- The fault-diameter and wide-diameter of twisted hypercubes (Q1682889) (← links)
- List colouring of graphs and generalized Dyck paths (Q1690249) (← links)
- Colouring of generalized signed triangle-free planar graphs (Q1712532) (← links)
- Extremal problems on saturation for the family of $k$-edge-connected graphs (Q1741522) (← links)
- Randomly twisted hypercubes (Q1746591) (← links)
- Greedy Nim\(\mathrm{_k}\) game (Q1752627) (← links)
- Defective 3-paintability of planar graphs (Q1753126) (← links)