The Hamiltonicity of bipartite graphs involving neighborhood unions
Discrete Mathematics
Graphs with large maximum degree containing no odd cycles of a given length
Journal of Combinatorial Theory Series B
Algorithms for long paths in graphs
Theoretical Computer Science
The k-dominating cycles in graphs
European Journal of Combinatorics
Algorithm for two disjoint long paths in 2-connected graphs
Theoretical Computer Science
| Hi-index | 0.05 |