Jinfeng Feng

12 papers C 2Journal 10
YearRankTypeTitle / Venue / Authors
2016 J jnl
Fabrication and Evaluation of a Graphene Oxide-Based Capacitive Humidity Sensor.
Sensors
Jinfeng Feng, Xiaoxu Kang, Qingyun Zuo, Chao Yuan, Weijun Wang, Yuhang Zhao, Limin Zhu, Hanwei Lu, Juying Chen
2009 J jnl
Each 3-strong Tournament Contains 3 Vertices Whose Out-arcs Are Pancyclic.
Graphs Comb.
Jinfeng Feng
2009 J jnl
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs.
Math. Methods Oper. Res.
Jinfeng Feng
2008 J jnl
Hamiltonian problem on claw-free and almost distance-hereditary graphs.
Discret. Math.
Jinfeng Feng, Yubao Guo
2008 J jnl
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament.
Discret. Appl. Math.
Ruijuan Li, Shengjia Li, Jinfeng Feng
2007 C conf
A characterization for jump graphs containing complementary cycles.
CTW
Jinfeng Feng
2007 J jnl
An efficient condition for a graph to be Hamiltonian.
Discret. Appl. Math.
Shengjia Li, Ruijuan Li, Jinfeng Feng
2007 J jnl
The graphs satisfying conditions of Ore's type.
Australas. J Comb.
Shengjia Li, Ruijuan Li, Jinfeng Feng
2007 C conf
The number of vertices whose out-arcs are pancyclic in 2-strong tournaments.
CTW
Ruijuan Li, Shengjia Li, Jinfeng Feng
2006 J jnl
An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic.
Discret. Appl. Math.
Jinfeng Feng, Shengjia Li, Ruijuan Li
2006 J jnl
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
J. Graph Theory
Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Z. Gutin, Tommy R. Jensen, Arash Rafiey
2006 J jnl
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs.
Electron. Notes Discret. Math.
Jinfeng Feng