Jinfeng Feng

According to our database1, Jinfeng Feng authored at least 11 papers between 2006 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Fabrication and Evaluation of a Graphene Oxide-Based Capacitive Humidity Sensor.
Sensors, 2016

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

2008
Hamiltonian problem on claw-free and almost distance-hereditary graphs.
Discret. Math., 2008

The number of vertices whose out-arcs are pancyclic in a 2-strong tournament.
Discret. Appl. Math., 2008

2007
An efficient condition for a graph to be Hamiltonian.
Discret. Appl. Math., 2007

The graphs satisfying conditions of Ore's type.
Australas. J Comb., 2007

The number of vertices whose out-arcs are pancyclic in 2-strong tournaments.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

A characterization for jump graphs containing complementary cycles.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
J. Graph Theory, 2006

Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs.
Electron. Notes Discret. Math., 2006

An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic.
Discret. Appl. Math., 2006


  Loading...