Anton Kotzig
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
Papers in
-
- graph theory and CDMA systems 24
-
- Advanced Graph Theory Research 15
- Graph Labeling and Dimension Problems 7
- semigroups and automata theory 3
- Co-authors
- Alexander Rosa (5 shared papers)Abraham Berman (2 shared papers)Pavol Hell (2 shared papers)Aviezri S. Fraenkel (2 shared papers)J. Turgeon (1 shared paper)Štefan Znám (2 shared papers)Václav Chvátal (1 shared paper)Roy O. Davies (1 shared paper)
- Journals
- Discrete Mathematics (12 papers)Journal of Combinatorial Theory Series B (3 papers)Aequationes Mathematicae (2 papers)Journal of Graph Theory (1 paper)Canadian Journal of Mathematics (1 paper)
- Partner nations
- CanadaIsraelUnited States
In The Last Decade
Anton Kotzig
42 papers receiving 584 citations
Peers
Comparison fields: 5 of 46
- Discrete Mathematics and Combinatorics 156
- Computational Theory and Mathematics 463
- Geometry and Topology 127
- Electrical and Electronic Engineering 341
- Computer Graphics and Computer-Aided Design 15
Countries citing papers authored by Anton Kotzig
This map shows the geographic impact of Anton Kotzig'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 Anton Kotzig with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anton Kotzig more than expected).
Fields of papers citing papers by Anton Kotzig
This network shows the impact of papers produced by Anton Kotzig. 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 Anton Kotzig. The network helps show where Anton Kotzig may publish in the future.
Co-authors
The 11 scholars most cited alongside Anton Kotzig, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 47 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1970 | 234 | |
| 2 | Moves Without Forbidden Transitions in a Graph | 1968 | 42 |
| 3 | 1979 | 41 | |
| 4 | 1957 | 34 | |
| 5 | 1981 | 26 | |
| 6 | 1981 | 23 | |
| 7 | 1976 | 19 | |
| 8 | 1975 | 17 | |
| 9 | 1979 | 15 | |
| 10 | 1988 | 15 | |
| 11 | 1980 | 14 | |
| 12 | 1968 | 14 | |
| 13 | 1977 | 14 | |
| 14 | 1962 | 12 | |
| 15 | 1996 | 11 | |
| 16 | 1978 | 11 | |
| 17 | 1987 | 10 | |
| 18 | 1970 | 9 | |
| 19 | 1968 | 9 | |
| 20 | 1980 | 9 |
About Anton Kotzig
Anton Kotzig is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 47 papers that have together received 666 indexed citations. Recurring topics across this work include graph theory and CDMA systems (24 papers), Advanced Graph Theory Research (15 papers), Graph theory and applications (10 papers), Graph Labeling and Dimension Problems (7 papers), Limits and Structures in Graph Theory (5 papers), Mathematics and Applications (5 papers), Rings, Modules, and Algebras (3 papers) and semigroups and automata theory (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (156 citations), Computational Theory and Mathematics (463 citations), Geometry and Topology (127 citations), Electrical and Electronic Engineering (341 citations) and Computer Graphics and Computer-Aided Design (15 citations). Anton Kotzig has collaborated with scholars based in Canada, Israel and United States. Frequent co-authors include Alexander Rosa, Abraham Berman, Pavol Hell, Aviezri S. Fraenkel, J. Turgeon, Štefan Znám, Václav Chvátal, Roy O. Davies, Ivo G. Rosenberg and Gert Sabidussi. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Aequationes Mathematicae, Journal of Graph Theory and Canadian Journal of 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.