324 results on '"Guantao Chen"'
Search Results
2. Soil biochemical responses to nitrogen addition in a secondary evergreen broad-leaved forest ecosystem
3. Decreasing the mean subtree order by adding k edges.
4. A decomposition method on solving the linear arboricity conjecture.
5. The core conjecture of Hilton and Zhao.
6. Linear arboricity of degenerate graphs.
7. Double Vizing fans in critical class two graphs.
8. On the coequal values of total chromatic number and chromatic index.
9. On Gupta's Codensity Conjecture.
10. Precoloring extension of Vizing's Theorem for multigraphs.
11. A note on Goldberg's conjecture on total chromatic numbers.
12. Independence number of edge-chromatic critical graphs.
13. Multithreshold multipartite graphs.
14. Overfullness of critical class 2 graphs with a small core degree.
15. The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree.
16. The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs.
17. Multiplicity of the second-largest eigenvalue of a planar graph.
18. Laminar tight cuts in matching covered graphs.
19. On the average degree of edge chromatic critical graphs.
20. Local Dirac's condition on the existence of 2-factor.
21. Unions of perfect matchings in r-graphs.
22. Spanning trees with at most k leaves in 2-connected K1,r-free graphs.
23. Ring graphs and Goldberg's bound on chromatic index.
24. The Chromatic Number of Graphs with No Induced Subdivision of K4.
25. On the average degree of edge chromatic critical graphs II.
26. Average degrees of edge-chromatic critical graphs.
27. Extremal Union-Closed Set Families.
28. Graph Edge Coloring: A Survey.
29. Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw.
30. Structural properties of edge-chromatic critical multigraphs.
31. Dirac's Condition for Spanning Halin Subgraphs.
32. Disjoint Odd Cycles in Cubic Solid Bricks.
33. An improvement to the Hilton-Zhao vertex-splitting conjecture.
34. Cycles with a chord in dense graphs.
35. Chromatic index determined by fractional chromatic index.
36. Double Vizing fans in critical class two graphs
37. Vizing's 2-Factor Conjecture Involving Large Maximum Degree.
38. Hamiltonicity of edge chromatic critical graphs.
39. Nonempty intersection of longest paths in series-parallel graphs.
40. Equitable vertex arboricity of 5-degenerate graphs.
41. Forbidden Pairs and the Existence of a Spanning Halin Subgraph.
42. Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs.
43. Plane Triangulations Without a Spanning Halin Subgraph II.
44. Dynamic Bayesian brain network partition and connectivity change point detection.
45. The conjunction of the linear arboricity conjecture and Lovász's path partition theorem.
46. Improved bounds on the Ramsey number of fans.
47. Bayesian Inference for Functional Dynamics Exploring in fMRI Data.
48. A Chvátal-Erdős type theorem for path-connectivity
49. Efficient parallel algorithms for maximum-density segment problem.
50. An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.