An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic. - Jinfeng Feng; Shengjia Li; Ruijuan Li (Discret. Appl. Math., 2006)

Characterization of edge-colored complete graphs with properly colored Hamilton paths. - Jinfeng Feng; Hans-Erik Giesen; Yubao Guo; Gregory Z. Gutin; Tommy R. Jensen; Arash Rafiey (J. Graph Theory, 2006)

A characterization for jump graphs containing complementary cycles. - Jinfeng Feng (CTW, 2007)

The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. - Ruijuan Li; Shengjia Li; Jinfeng Feng (CTW, 2007)

The graphs satisfying conditions of Ore's type. - Shengjia Li; Ruijuan Li; Jinfeng Feng (Australas. J Comb., 2007)

An efficient condition for a graph to be Hamiltonian. - Shengjia Li; Ruijuan Li; Jinfeng Feng (Discret. Appl. Math., 2007)

The number of vertices whose out-arcs are pancyclic in a 2-strong tournament. - Ruijuan Li; Shengjia Li; Jinfeng Feng (Discret. Appl. Math., 2008)

Hamiltonian problem on claw-free and almost distance-hereditary graphs. - Jinfeng Feng; Yubao Guo (Discret. Math., 2008)

Each 3-strong Tournament Contains 3 Vertices Whose Out-arcs Are Pancyclic. - Jinfeng Feng (Graphs Comb., 2009)

Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs. - Jinfeng Feng (Math. Methods Oper. Res., 2009)

Fabrication and Evaluation of a Graphene Oxide-Based Capacitive Humidity Sensor. - Jinfeng Feng; Xiaoxu Kang; Qingyun Zuo; Chao Yuan; Weijun Wang; Yuhang Zhao 002; Limin Zhu; Hanwei Lu; Juying Chen (Sensors, 2016)