The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jinfeng Feng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jinfeng Feng, Shengjia Li, Ruijuan Li
    An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:18, pp:2609-2612 [Journal]
  2. Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Gutin, Tommy R. Jensen, Arash Rafiey
    Characterization of edge-colored complete graphs with properly colored Hamilton paths. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:4, pp:333-346 [Journal]
  3. Shengjia Li, Ruijuan Li, Jinfeng Feng
    An efficient condition for a graph to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1842-1845 [Journal]

  4. The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. [Citation Graph (, )][DBLP]


  5. A characterization for jump graphs containing complementary cycles. [Citation Graph (, )][DBLP]


  6. The number of vertices whose out-arcs are pancyclic in a 2-strong tournament. [Citation Graph (, )][DBLP]


  7. Hamiltonian problem on claw-free and almost distance-hereditary graphs. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
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