134 results on '"Zhu, Xuding"'
Search Results
2. Generalized signed graphs of large girth and large chromatic number
3. The circular chromatic numbers of signed series-parallel graphs
4. Weighted-1-antimagic graphs of prime power order
5. Decomposition of sparse graphs, with application to game coloring number
6. Acyclic 4-choosability of planar graphs
7. Adaptable chromatic number of graph products
8. Adaptable choosability of planar graphs with sparse short cycles
9. Colouring graphs with bounded generalized colouring number
10. Game colouring of the square of graphs
11. Circular game chromatic number of graphs
12. Colouring games on outerplanar graphs and trees
13. The 6-relaxed game chromatic number of outerplanar graphs
14. Coloring the Cartesian sum of graphs
15. The strong fractional choice number of series–parallel graphs
16. The Alon–Tarsi number of planar graphs without cycles of lengths 4 and l
17. Incidence coloring of k-degenerated graphs
18. Relaxed game chromatic number of trees and outerplanar graphs
19. Relaxed game chromatic number of graphs
20. 4-Colorable 6-regular toroidal graphs
21. Circular chromatic numbers of a class of distance graphs
22. Construction of Kn-minor free graphs with given circular chromatic number
23. Colouring of generalized signed triangle-free planar graphs
24. Graphs are (1,Δ+1)-choosable
25. On Hedetniemi's conjecture and the colour template scheme
26. The level of nonmultiplicativity of graphs
27. Tight relation between the circular chromatic number and the girth of series-parallel graphs
28. The circular chromatic number of series-parallel graphs of large odd girth
29. Construction of sparse graphs with prescribed circular colorings
30. Circular chromatic number: a survey
31. The game coloring number of pseudo partial k-trees
32. Total list weighting of graphs with bounded maximum average degree
33. Graphs with maximum average degree less than 114 are (1,3)-choosable
34. List colouring of graphs and generalized Dyck paths
35. Circular chromatic numbers of Mycielski's graphs
36. A bound for the game chromatic number of graphs
37. Total weight choosability of graphs with bounded maximum average degree
38. Circular total chromatic numbers of graphs
39. Locally planar graphs are 5-paintable
40. Circular chromatic indices of even degree regular graphs
41. Anti-magic labeling of trees
42. Distinguishing labeling of group actions
43. Backbone coloring for graphs with large girths
44. The strong game colouring number of directed graphs
45. Lower bounds for the game colouring number of partial k-trees and planar graphs
46. Preface
47. Acyclic 4-choosability of planar graphs
48. Coloring the square of a K4-minor free graph
49. Circular chromatic number
50. Chromatic Ramsey numbers
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.