61 results on '"Zhu, Xuding"'
Search Results
2. Circular flows in mono‐directed signed graphs
3. The Alon–Tarsi number of planar graphs revisited
4. Girth and λ $\lambda $‐choosability of graphs
5. The strong fractional choice number of 3‐choice‐critical graphs
6. Decomposing planar graphs into graphs with degree restrictions
7. Signed colouring and list colouring of k‐chromatic graphs
8. 3‐Degenerate induced subgraph of a planar graph
9. Chromatic λ‐choosable and λ‐paintable graphs
10. Multiple list coloring of 3‐choice critical graphs
11. List coloring triangle‐free planar graphs
12. Fractional DP‐colorings of sparse graphs
13. A Hypercube Variant with Small Diameter
14. On (4, 2)-Choosable Graphs
15. Strong Chromatic Index of Sparse Graphs
16. Antimagic Labeling of Regular Graphs
17. Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
18. Regular Graphs of Odd Degree Are Antimagic
19. Partial Online List Coloring of Graphs
20. Antimagic Labeling of Cubic Graphs
21. Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
22. Antimagic labelling of vertex weighted graphs
23. Circular consecutive choosability of k-choosable graphs
24. Short cycle covers of graphs and nowhere-zero flows
25. Total weight choosability of graphs
26. Nonrepetitive list colourings of paths
27. Choosability of toroidal graphs without short cycles
28. Claw‐free circular‐perfect graphs
29. Adapted list coloring of planar graphs
30. Multi-coloring the Mycielskian of graphs
31. Game coloring the Cartesian product of graphs
32. Circular choosability via combinatorial Nullstellensatz
33. Circular chromatic index of Cartesian products of graphs
34. List circular coloring of trees and cycles
35. On the circular chromatic number of circular partitionable graphs
36. Circular perfect graphs
37. Circular choosability of graphs
38. Circular chromatic index of graphs of maximum degree 3
39. D. Liu and X. Zhu, Erratum to: ?Fractional chromatic number and circular chromatic number for distance graphs with large clique size?.Journal of Graph Theory47(2) 2004, 129-146
40. Fractional chromatic number and circular chromatic number for distance graphs with large clique size
41. Density of the circular chromatic numbers of series‐parallel graphs
42. Circular chromatic number and Mycielski construction
43. Circular chromatic number of subgraphs
44. Construction of graphs with given circular flow numbers
45. Edge‐partitions of planar graphs and their game coloring numbers
46. Circular chromatic number of distance graphs with distance sets of cardinality 3
47. Game chromatic index ofk-degenerate graphs
48. The circular chromatic number of series-parallel graphs with large girth
49. The circular chromatic number of series-parallel graphs
50. The circular chromatic number of series‐parallel graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.