|
Search the dblp DataBase
Jinfeng Feng:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. [Citation Graph (, )][DBLP]
A characterization for jump graphs containing complementary cycles. [Citation Graph (, )][DBLP]
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament. [Citation Graph (, )][DBLP]
Hamiltonian problem on claw-free and almost distance-hereditary graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|