Bert L. Hartnell
- Computational Theory and Mathematics top 1%
- Geometry and Topology top 5%
- Discrete Mathematics and Combinatorics top 5%
- Computer Networks and Communications top 10%
- Electrical and Electronic Engineering
- Co-authors
- Douglas F. RallRichard J. NowakowskiMichael D. PlummerMichael A. HenningBoštjan BrešarPaul DorbecWayne GoddardSandi Klavžar
- Topics
- Advanced Graph Theory Research (45 papers)Graph Labeling and Dimension Problems (27 papers)graph theory and CDMA systems (14 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- CanadaUnited StatesSlovenia
In The Last Decade
Bert L. Hartnell
48 papers receiving 479 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 491
- Geometry and Topology 147
- Discrete Mathematics and Combinatorics 141
- Computer Networks and Communications 137
- Electrical and Electronic Engineering 74
Countries citing papers authored by Bert L. Hartnell
This map shows the geographic impact of Bert L. Hartnell'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 Bert L. Hartnell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bert L. Hartnell more than expected).
Fields of papers citing papers by Bert L. Hartnell
This network shows the impact of papers produced by Bert L. Hartnell. 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 Bert L. Hartnell. The network helps show where Bert L. Hartnell may publish in the future.
Co-authorship network of co-authors of Bert L. Hartnell
This figure shows the co-authorship network connecting the top 25 collaborators of Bert L. Hartnell. A scholar is included among the top collaborators of Bert L. Hartnell 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 Bert L. Hartnell. Bert L. Hartnell is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 0 | |
| 3 | 3 | |
| 4 | 4 | |
| 5 | A note on equimatchable graphs | 14 |
| 6 | 6 | |
| 7 | 23 | |
| 8 | 10 | |
| 9 | Decycling sets in certain cartesian product graphs with one factor complete. | 0 |
| 10 | On graphs having uniform size star factors. | 2 |
| 11 | Dominating sets with at most k components | 1 |
| 12 | 43 | |
| 13 | A game based on vertex-magic total labelings. | 0 |
| 14 | 2 | |
| 15 | On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. | 1 |
| 16 | On k-packings of graphs. | 2 |
| 17 | On The Local Structure Of Well-Covered Graphs Without 4-Cycles. | 3 |
| 18 | A characterization of parity graphs containing no cycle of order five or less. | 4 |
| 19 | 73 | |
| 20 | 21 |
About Bert L. Hartnell
Bert L. Hartnell is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 52 papers that have together received 538 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (45 papers), Graph Labeling and Dimension Problems (27 papers) and graph theory and CDMA systems (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (141 citations), Computational Theory and Mathematics (491 citations) and Geometry and Topology (147 citations). Bert L. Hartnell has collaborated with scholars based in Canada, United States and Slovenia. Frequent co-authors include Douglas F. Rall, Richard J. Nowakowski, Michael D. Plummer, Michael A. Henning, Boštjan Brešar, Paul Dorbec, Wayne Goddard, Sandi Klavžar, Preben Dahl Vestergaard and Robert Gallant. Their work appears in journals such as Networks, Discrete Applied Mathematics and Discrete Mathematics.
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.