The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gexin Yu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matt DeVos, Rui Xu, Gexin Yu
    Nowhere-zero Z3-flows through Z3-connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:26-30 [Journal]
  2. Alexandr V. Kostochka, Gexin Yu
    An extremal problem for H-linked graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:4, pp:321-339 [Journal]

  3. On a graph packing conjecture by Bollobás, Eldridge and Catlin. [Citation Graph (, )][DBLP]


  4. Injective colorings of graphs with low average degree [Citation Graph (, )][DBLP]


  5. A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid [Citation Graph (, )][DBLP]


  6. Ore-type graph packing problems. [Citation Graph (, )][DBLP]


  7. On Sufficient Degree Conditions for a Graph to be k-linked. [Citation Graph (, )][DBLP]


  8. Minimum degree conditions for H-linked graphs. [Citation Graph (, )][DBLP]


  9. Hamiltonian connectedness in 3-connected line graphs. [Citation Graph (, )][DBLP]


  10. An inequality for the group chromatic number of a graph. [Citation Graph (, )][DBLP]


  11. Ore-type conditions implying 2-factors consisting of short cycles. [Citation Graph (, )][DBLP]


  12. Injective colorings of sparse graphs. [Citation Graph (, )][DBLP]


  13. Ore-condition and Z3-connectivity. [Citation Graph (, )][DBLP]


  14. Decomposing a planar graph with girth 9 into a forest and a matching. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002