25 results on '"Zhu, Xuding"'
Search Results
2. Every nice graph is (1,5)-choosable
3. Relatively small counterexamples to Hedetniemi's conjecture
4. The Alon-Tarsi number of a planar graph minus a matching
5. A refinement of choosability of graphs
6. Multiple list colouring triangle free planar graphs
7. Multiple list colouring of planar graphs
8. Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2
9. Circular flow number of highly edge connected signed graphs
10. Decomposing a graph into forests
11. Entire colouring of plane graphs
12. Circular flow on signed graphs
13. Bipartite subgraphs of triangle-free subcubic graphs
14. Refined activation strategy for the marking game
15. The circular chromatic index of graphs of high girth
16. The Alon–Tarsi number of planar graphs
17. On sparse graphs with given colorings and homomorphisms
18. Circular chromatic number of Kneser graphs
19. Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k≤ 2
20. Circular Colouring and Orientation of Graphs
21. Planar Graphs with Circular Chromatic Numbers between 3 and 4
22. Distance Graphs andT-Coloring
23. The Game Coloring Number of Planar Graphs
24. Pattern Periodic Coloring of Distance Graphs
25. The circular chromatic number of induced subgraphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.