107 results on '"Wu, Hehui"'
Search Results
2. Partitioning graphs with linear minimum degree
3. List-avoiding orientations
4. Graph Partitions Under Average Degree Constraint
5. Proper orientations and proper chromatic number
6. Note on the Tur\'an number of the $3$-linear hypergraph $C_{13}$
7. The inducibility of oriented stars
8. Graph partitions under average degree constraint
9. The Betti Number of the Independence Complex of Ternary Graphs
10. A Ramsey Type problem for highly connected subgraphs
11. The inducibility of oriented stars
12. Proper orientations and proper chromatic number
13. 1-subdivisions, fractional chromatic number and Hall ratio
14. Triangle-free subgraphs with large fractional chromatic number
15. Fractional chromatic number of a random subgraph
16. Word-representability of split graphs
17. Coloring tournaments: from local to global
18. Dichromatic number and fractional chromatic number
19. The extremal function for disconnected minors
20. Partitioning graphs with linear minimum degree.
21. Large Supports are required for Well-Supported Nash Equilibria
22. 1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio
23. Interval minors of complete bipartite graphs
24. The total Betti number of the independence complex of ternary graphs
25. Coloring tournaments: From local to global
26. Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices
27. A Proof of a Conjecture of Ohba
28. Complete Minors, Independent Sets, and Chordal Graphs
29. Parity Edge-Coloring of Graphs
30. The extremal function for disconnected minors
31. Subgraphs of Kneser graphs with large girth and large chromatic number
32. Beyond Ohba’s Conjecture: A bound on the choice number of [formula omitted]-chromatic graphs with [formula omitted] vertices
33. On the Turán Number of the Linear $3$-Graph $C_{13}$
34. Packing of Steiner trees and S-connectors in graphs
35. Longest cycles in k-connected graphs with given independence number
36. Triangle-free subgraphs with large fractional chromatic number
37. On mod [formula omitted]-orientations of graphs
38. Optimal strong parity edge-coloring of complete graphs
39. Word-representability of split graphs
40. Triangle-free subgraphs with large fractional chromatic number.
41. Every 3-connected, essentially 11-connected line graph is Hamiltonian
42. Fractional chromatic number of a random subgraph
43. Triangle-free subgraphs with large fractional chromatic number
44. Beyond Ohba’s conjecture : a bound on the choice number of k-chromatic graphs with n vertices\ud
45. Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond
46. DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
47. Weak duality for packing edge-disjoint odd (u, v)-trails
48. Interval Minors of Complete Bipartite Graphs
49. Beyond Ohba’s Conjecture: A bound on the choice number ofk-chromatic graphs withnvertices
50. A Proof of a Conjecture of Ohba
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.