2008 |
8 | EE | Ruijuan Li,
Shengjia Li,
Jinfeng Feng:
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament.
Discrete Applied Mathematics 156(1): 88-92 (2008) |
7 | EE | Jinfeng Feng,
Yubao Guo:
Hamiltonian problem on claw-free and almost distance-hereditary graphs.
Discrete Mathematics 308(24): 6558-6563 (2008) |
2007 |
6 | | Jinfeng Feng:
A characterization for jump graphs containing complementary cycles.
CTW 2007: 39-42 |
5 | | Ruijuan Li,
Shengjia Li,
Jinfeng Feng:
The number of vertices whose out-arcs are pancyclic in 2-strong tournaments.
CTW 2007: 95-97 |
4 | EE | Shengjia Li,
Ruijuan Li,
Jinfeng Feng:
An efficient condition for a graph to be Hamiltonian.
Discrete Applied Mathematics 155(14): 1842-1845 (2007) |
2006 |
3 | EE | Jinfeng Feng,
Shengjia Li,
Ruijuan Li:
An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic.
Discrete Applied Mathematics 154(18): 2609-2612 (2006) |
2 | EE | Jinfeng Feng:
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs.
Electronic Notes in Discrete Mathematics 25: 55 (2006) |
1 | EE | 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.
Journal of Graph Theory 53(4): 333-346 (2006) |