Margit Voigt

1.3k total citations
44 papers, 651 citations indexed

About

Margit Voigt is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Margit Voigt has authored 44 papers receiving a total of 651 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 18 papers in Discrete Mathematics and Combinatorics and 5 papers in Electrical and Electronic Engineering. Recurrent topics in Margit Voigt's work include Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (23 papers) and Limits and Structures in Graph Theory (18 papers). Margit Voigt is often cited by papers focused on Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (23 papers) and Limits and Structures in Graph Theory (18 papers). Margit Voigt collaborates with scholars based in Germany, Hungary and Slovakia. Margit Voigt's co-authors include Zs. Tuza, Hans‐Otto Walther, Jochen Harant, Brunhilde Wirth, Imre Z. Ruzsa, Noga Alon, Stanislav Jendrol′, Yannis Manoussakis, Arnfried Kemnitz and Ingo Schiermeyer and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Margit Voigt

42 papers receiving 590 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Margit Voigt Germany 13 610 246 143 127 97 44 651
Éric Sopena France 15 823 1.3× 467 1.9× 165 1.2× 77 0.6× 62 0.6× 58 882
Jochen Harant Germany 13 408 0.7× 151 0.6× 75 0.5× 64 0.5× 68 0.7× 62 448
R. E. L. Aldred New Zealand 13 465 0.8× 184 0.7× 158 1.1× 81 0.6× 118 1.2× 76 543
Jianliang Wu China 12 473 0.8× 134 0.5× 105 0.7× 73 0.6× 65 0.7× 80 538
Michael Stiebitz Germany 14 504 0.8× 366 1.5× 79 0.6× 31 0.2× 40 0.4× 51 555
Tomáš Kaiser Czechia 12 348 0.6× 194 0.8× 73 0.5× 41 0.3× 59 0.6× 60 404
Charles Payan France 10 402 0.7× 116 0.5× 88 0.6× 28 0.2× 118 1.2× 27 481
Martin Kochol Slovakia 13 395 0.6× 225 0.9× 115 0.8× 58 0.5× 74 0.8× 55 448
Daniel W. Cranston United States 12 413 0.7× 185 0.8× 82 0.6× 27 0.2× 33 0.3× 57 459
Kathie Cameron Canada 11 541 0.9× 229 0.9× 66 0.5× 21 0.2× 183 1.9× 43 589

Countries citing papers authored by Margit Voigt

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Axenovich, Maria, et al.. (2016). A note on adjacent vertex distinguishing colorings of graphs. Discrete Applied Mathematics. 205. 1–7. 10 indexed citations
2.
Jendrol′, Stanislav, et al.. (2016). Facial list colourings of plane graphs. Discrete Mathematics. 339(11). 2826–2831. 7 indexed citations
3.
Kemnitz, Arnfried, et al.. (2016). Sum choice number of generalized θ-graphs. Discrete Mathematics. 340(11). 2633–2640. 4 indexed citations
4.
Stiebitz, Michael, Źsolt Tuza, & Margit Voigt. (2013). Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs and Combinatorics. 31(1). 265–280. 1 indexed citations
5.
Voigt, Margit, et al.. (2012). Weights of induced subgraphs in K1,r-free graphs. Discrete Mathematics. 312(16). 2429–2432. 1 indexed citations
6.
Jendrol′, Stanislav, et al.. (2011). Parity vertex colouring of plane graphs. Discrete Mathematics. 311(6). 512–520. 11 indexed citations
7.
Stiebitz, Michael, Źsolt Tuza, & Margit Voigt. (2008). On list critical graphs. Discrete Mathematics. 309(15). 4931–4941. 1 indexed citations
8.
Bacsó, Gábor, Zs. Tuza, & Margit Voigt. (2006). Characterization of graphs dominated by induced paths. Discrete Mathematics. 307(7-8). 822–826. 3 indexed citations
9.
Voigt, Margit. (2006). A non-3-choosable planar graph without cycles of length 4 and 5. Discrete Mathematics. 307(7-8). 1013–1015. 16 indexed citations
10.
Tuza, Zs. & Margit Voigt. (2002). A note on planar 5-list colouring: non-extendability at distance 4. Discrete Mathematics. 251(1-3). 169–172. 6 indexed citations
11.
Schiermeyer, Ingo, Zs. Tuza, & Margit Voigt. (2000). On-line rankings of graphs. Discrete Mathematics. 212(1-2). 141–147. 8 indexed citations
12.
Voigt, Margit. (1999). Colouring of distance graphs.. Ars Combinatoria. 52. 18 indexed citations
13.
Mihók, Peter, et al.. (1998). On uniquely partitionable planar graphs. Discrete Mathematics. 191(1-3). 149–158. 1 indexed citations
14.
Kratochvı́l, Jan, Zs. Tuza, & Margit Voigt. (1998). Complexity of choosing subsets from color sets. Discrete Mathematics. 191(1-3). 139–148. 3 indexed citations
15.
Alon, Noga, Zs. Tuza, & Margit Voigt. (1997). Choosability and fractional chromatic numbers. Discrete Mathematics. 165-166. 31–38. 25 indexed citations
16.
Tuza, Zs. & Margit Voigt. (1996). Every 2-choosable graph is (2 m, m )-choosable. Journal of Graph Theory. 22(3). 245–252. 13 indexed citations
17.
Voigt, Margit & Hans‐Otto Walther. (1994). Chromatic number of prime distance graphs. Discrete Applied Mathematics. 51(1-2). 197–209. 30 indexed citations
18.
Voigt, Margit. (1993). List colourings of planar graphs. Discrete Mathematics. 120(1-3). 215–219. 149 indexed citations
19.
Voigt, Margit. (1992). On the chromatic number of distance graphs. Journal of automata, languages and combinatorics. 28(1). 21–28. 5 indexed citations
20.
Voigt, Margit & Hans‐Otto Walther. (1991). On the chromatic number of special distance graphs. Discrete Mathematics. 97(1-3). 395–397. 16 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026