The following pages link to Jinfeng Feng (Q858310):
Displayed 12 items.
- An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic (Q858311) (← links)
- Hamiltonian problem on claw-free and almost distance-hereditary graphs (Q998395) (← links)
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic (Q1043814) (← links)
- An efficient condition for a graph to be Hamiltonian (Q2383542) (← links)
- The number of vertices whose out-arcs are pancyclic in a 2-strong tournament (Q2462354) (← links)
- (Q3154135) (← links)
- Characterization of edge-colored complete graphs with properly colored Hamilton paths (Q3418198) (← links)
- (Q4937604) (← links)
- (Q5294910) (← links)
- Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws† (Q5449017) (← links)
- Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs (Q5899385) (← links)
- Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs (Q5901555) (← links)