H.J. Veldman
About
In The Last Decade
H.J. Veldman
56 papers receiving 648 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 632
- Discrete Mathematics and Combinatorics 348
- Geometry and Topology 289
- Computer Networks and Communications 185
- Electrical and Electronic Engineering 121
Countries citing papers authored by H.J. Veldman
This map shows the geographic impact of H.J. Veldman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by H.J. Veldman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites H.J. Veldman more than expected).
Fields of papers citing papers by H.J. Veldman
This network shows the impact of papers produced by H.J. Veldman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by H.J. Veldman. The network helps show where H.J. Veldman may publish in the future.
Co-authorship network of co-authors of H.J. Veldman
This figure shows the co-authorship network connecting the top 25 collaborators of H.J. Veldman. A scholar is included among the top collaborators of H.J. Veldman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with H.J. Veldman. H.J. Veldman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 61 | |
| 2 | 1 | |
| 3 | Chordality and 2-Factors in Tough Graphs | 0 |
| 4 | 22 | |
| 5 | 5 | |
| 6 | 8 | |
| 7 | 2 | |
| 8 | On generalizing a theorem of Jung | 4 |
| 9 | 25 | |
| 10 | 28 | |
| 11 | Pancyclicity of Hamiltonian line graphs | 1 |
| 12 | Cycles containing all vertices of maximum degree | 1 |
| 13 | Updated contributions to the Twente Workshop on Hamiltonian Graph Theory | 4 |
| 14 | Cycles in tough graphs | 1 |
| 15 | 5 | |
| 16 | 22 | |
| 17 | Cycles containing many vertices of large degree | 1 |
| 18 | Short proofs of some Fan-type results | 2 |
| 19 | Remarks on hamiltonian properties of claw-free graphs | 14 |
| 20 | 5 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.