Margit Voigt
About
In The Last Decade
Margit Voigt
42 papers receiving 590 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 610
- Discrete Mathematics and Combinatorics 246
- Electrical and Electronic Engineering 143
- Computer Graphics and Computer-Aided Design 127
- Computer Networks and Communications 97
Countries citing papers authored by Margit Voigt
This map shows the geographic impact of Margit Voigt'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 Margit Voigt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Margit Voigt more than expected).
Fields of papers citing papers by Margit Voigt
This network shows the impact of papers produced by Margit Voigt. 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 Margit Voigt. The network helps show where Margit Voigt may publish in the future.
Co-authorship network of co-authors of Margit Voigt
This figure shows the co-authorship network connecting the top 25 collaborators of Margit Voigt. A scholar is included among the top collaborators of Margit Voigt 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 Margit Voigt. Margit Voigt is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | A note on adjacent vertex distinguishing colorings of graphs | Discrete Applied Mathematics | Maria Axenovich, Jochen Harant et al. | 10 |
| 2 | Facial list colourings of plane graphs | Discrete Mathematics | Stanislav Jendrol′, Margit Voigt et al. | 7 |
| 3 | Sum choice number of generalized | Discrete Mathematics | Arnfried Kemnitz, Margit Voigt et al. | 4 |
| 4 | Orientations of Graphs with Prescribed Weighted Out-Degrees | Graphs and Combinatorics | Michael Stiebitz, Źsolt Tuza et al. | 1 |
| 5 | Weights of induced subgraphs in | Discrete Mathematics | Margit Voigt et al. | 1 |
| 6 | Parity vertex colouring of plane graphs | Discrete Mathematics | Stanislav Jendrol′, Margit Voigt et al. | 11 |
| 7 | On list critical graphs | Discrete Mathematics | Michael Stiebitz, Źsolt Tuza et al. | 1 |
| 8 | Characterization of graphs dominated by induced paths | Discrete Mathematics | Gábor Bacsó, Zs. Tuza et al. | 3 |
| 9 | A non-3-choosable planar graph without cycles of length 4 and 5 | Discrete Mathematics | Margit Voigt | 16 |
| 10 | A note on planar 5-list colouring: non-extendability at distance 4 | Discrete Mathematics | Zs. Tuza, Margit Voigt | 6 |
| 11 | On-line rankings of graphs | Discrete Mathematics | Ingo Schiermeyer, Zs. Tuza et al. | 8 |
| 12 | Colouring of distance graphs. | Ars Combinatoria | Margit Voigt | 18 |
| 13 | On uniquely partitionable planar graphs | Discrete Mathematics | Peter Mihók, Margit Voigt et al. | 1 |
| 14 | Complexity of choosing subsets from color sets | Discrete Mathematics | Jan Kratochvı́l, Zs. Tuza et al. | 3 |
| 15 | Choosability and fractional chromatic numbers | Discrete Mathematics | Noga Alon, Zs. Tuza et al. | 25 |
| 16 | Every 2-choosable graph is (2 m, m )-choosable | Journal of Graph Theory | Zs. Tuza, Margit Voigt | 13 |
| 17 | Chromatic number of prime distance graphs | Discrete Applied Mathematics | Margit Voigt, Hans‐Otto Walther | 30 |
| 18 | List colourings of planar graphs | Discrete Mathematics | Margit Voigt | 149 |
| 19 | On the chromatic number of distance graphs | Journal of automata, languages and combinatorics | Margit Voigt | 5 |
| 20 | On the chromatic number of special distance graphs | Discrete Mathematics | Margit Voigt, Hans‐Otto Walther | 16 |
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.