Prof. Dr. Margit Voigt 

Publikationen

M. Voigt, H. Walther: On the chromatic number of special distance graphs, Discrete Mathematics 97 (1991) 395 - 397




M. Voigt: On the chromatic number of distance graphs, Journal of Information Processing and Cybernetics EIK 28(1) (1992) 21- 28 (früher: Elektron. Inform.verarb. Kybernet.)

M. Voigt: Über die chromatische Zahl einer speziellen Klasse unendlicher Graphen, Dissertationsschrift, TU Ilmenau, 1992




M. Voigt: List colourings of planar graphs, Discrete Math. 120(1-3) (1993) 215-219




M. Voigt, H. Walther: Chromatic number of prime distance graphs, Discrete Applied Math. 51 (1994) 197 - 209




M. Voigt: A not 3-choosable planar graph without 3-cycles, Discrete Math. 146 (1995) 325-328




Y. Manoussakis, M. Spyratos, Zs. Tuza, M. Voigt: Minimal Colorings for Properly Colored Subgraphs, Graphs and Combinatorics 12(1) (1996) 345-360

M. Voigt: Choosability of planar graphs, Discrete Mathematics 150(1-3) (1996) 457-460

Zs. Tuza, M. Voigt: On a conjecture of Erdös, Rubin and Taylor, Tatra Mountains Mathematical Publications 9 (1996) 69-82

I. Broere, E. Jonck, M. Voigt: The induced path number of a complete multipartite graph, Tatra Mountains Mathematical Publications 9 (1996) 83-88

Zs. Tuza, M. Voigt: Every 2-choosable graph is (2m,m)-choosable, Journal of Graph Theory 22(3) (1996) 245-252




Zs. Tuza, M. Voigt: List Colorings and Reducibility, Discrete Applied Math. 79(1-3) (1997) 247-256

N. Alon, Zs. Tuza, M. Voigt: Choosability and fractional chromatic number, Discrete Math. 165-166 (1997) 31-38

M.Voigt, B.Wirth: On 3-colorable non-4-choosable planar graphs, Journal of Graph Theory 24(3) (1997) 233-235

J. Kratochvíl, Zs. Tuza, M. Voigt: New trends in the theory of graph colorings: Choosability and list coloring, Contemporary Trends in Discrete Mathematics (1997) 183-198




J. Kratochvil, Zs. Tuza, M. Voigt: Complexity of Choosing Subsets from Color Sets, Discrete Math. 191(1-3) (1998) 139-148

J. Bucko, P. Mihok, M. Voigt: On Uniquely Partitionable Planar Graphs, Discrete Math. 191(1-3) (1998) 149-158

J. Kratochvil, Zs. Tuza, M. Voigt: Brooks-type theorems for choosability with separation, Journal of Graph Theory 27(1) (1998) 43-49

M. Voigt: On List Colourings and Choosability of Graphs, Habilitationsschrift, TU Ilmenau (1998)

Th. Böhme, M. Stiebitz, M. Voigt: On uniquely 4-colorable planar graphs, Preprint No. M 10/98, TU Ilmenau (1998)




M. Voigt: Colouring of distance graphs, Ars Combinatoria 52 (1999)

J. Harant, A. Pruchnewski, M. Voigt: On dominating sets and independent sets of graphs, Combinatorics, Probability and Computing 8(6) (1999) 547-553

M. Mihok, Zs. Tuza, M.Voigt: Fractional P-colorings and P-choice-ratio, Tatra Mountains Mathematical Publications 18 (1999) 69-78

J. Kratochvil, Zs. Tuza, M. Voigt: New trends in the theory of graph colorings: Choosability and list colorings, DIMACS, Series in Discrete Mathematics and Theoretical Computer Science 49 (1999) 183-198

M. Borowiecki, P. Mihók, Zs. Tuza, M. Voigt: Remarks on the existence of uniquely partitionable planar graphs, Discussiones Math. Graph Theory 19(2) (1999) 159-166




I.Schiermeyer, Zs.Tuza, M.Voigt: On-line rankings of graphs, Discrete Math. 212(1-2) (2000) 141-147

M. Voigt: Algorithmic aspects of partial list colorings, Combinatorics, Probability and Computing 9(4) (2000) 375-380




J. Harant, S. Jendrol, B. Randerath, Z.Ryjacek, I. Schiermeyer, M. Voigt: On weights of induced paths and cycles in claw-free and ..., Journal of Graph Theory 36(3) (2001) 131-143

Zs. Tuza, M. Voigt: Oriented list colorings of graphs, Journal of Graph Theory 36(4) (2001) 217-229




Zs. Tuza, M. Voigt: A note on planar 5-list colouring: Non extendability at distance 4, Discrete Math. 251(1-3) (2002) 169-172

M. Voigt, H. Walther: Polyhedral graphs with restricted number of faces of the same type, Discrete Math. 244 (2002) 473-478

I.Z. Ruzsa, Zs. Tuza, M. Voigt: Distance graphs with finite chromatic number, JCT (B) 85(1) (2002) 181-187

J. Kratochvil, Zs. Tuza, M. Voigt: On the b-chromatic number of graphs, Lecture Notes in Computer Science, Springer Verlag, Tagungsband WG2002 (28th International Workshop on Graph Theoretical Concepts in Computer Science, Cesky Krumlov, Czech Republic, 13.6.-15.6.2002)




J. Kara, J. Kratochvil, M. Voigt: b-continuity , Preprint No. M 14/04, Technical University Ilmenau, Fakulty for Mathematics and Natural Sciences




A. Kohl, J. Schreyer, Zs. Tuza, M. Voigt: List version of L(d,s)-labelings, Theoretical Computer Science 349 (2005) 92-98




M. Voigt: List colourings of planar graphs, Discrete Math. 306(10-11) (2006) - 35th Special Anniversary Issue: Selected reprints of papers published in Discrete Mathematics, 1076-1079




M. Voigt: A non-3-choosable planar graph without cycles of length 4 and 5, Discrete Math. 307 (2007) 1013-1015

G. Bacso, Zs. Tuza, M. Voigt: Characterization of graphs dominated by paths of bounded length, Discrete Math. 307 (2007) 822-826

M. Voigt: Precoloring Extension for 2-connected Graphs, SIAM J. Discrete Math. 21(1) (2007) 258-263




M. Stiebitz, Zs. Tuza, M. Voigt: On List Critical Graphs, Discrete Math. 309 (2009) 4931-4941

A. Pruchnewski, M. Voigt: Precoloring extension for K_4-minor-free graphs, Journal of Graph Theory 60(4) (2009) 284-294

M. Voigt: Precoloring extension for 2-connected graphs with maximum degree three, Discrete Math. 309(15) (2009) 4926-4930




J. Czap, S. Jendrol, M. Voigt: Parity vertex colouring of plane graphs, Discrete Math. 311 (2011) 512-520




A. Pruchnewski, M. Voigt: Weights of induced subgraphs in K_{1,r}-free graphs, Discrete Math. 312(16) (2012) 2429-2432

D. Cranston, A. Pruchnewski, Zs. Tuza, M. Voigt: List colorings of K_5-minor-free graphs with special list assignments, Journal of Graph Theory 71(1) (2012) 18-30, DOI:10.1002/jgt.20628

A. Kemnitz, P. Mihok, M. Voigt: Fractional (P,Q)-total list colorings of graphs, Discussiones Math. Graph Theory 33 (2013) 167-179, DOI:10.7151/dmgt.1649




M. Stiebitz, Zs. Tuza, M. Voigt: Orientations of graphs with prescribed weighted out-degrees, Graphs and Combinatorics 31(1) (2015) 265-280

A. Kemnitz, M. Marangio, A. Pruchnewski, M. Voigt: (P,Q)-Total (r,s)-Colorings of Graphs, Discrete Math. 338(10) (2015) 1722-1729, DOI:10.1016/j.disc.2014.09.012

A. Kemnitz, M. Marangio, M. Voigt: Sum list colorings of wheels, Graphs and Combinatorics 31(1) (2015) 265-280, DOI 10.1007/s00373-015-1565-y




M. Axenovich, J. Harant, J. Przybylo, R. Sotak, M. Voigt, J. Weidelich: A note on adjacent vertex distinduishing colorings of graphs, Discrete Applied Math. 205 (2016) 1-7

A. Kemnitz, M. Marangio, M. Voigt: Sum list edge colorings of graphs, Discussiones Math. Graph Theory 36(3) (2016) 709-722

I. Fabrici, S. Jendrol, M. Voigt: Facial list colourings of plane graphs, Discrete Math. 339(11) (2016) 2826-2831




C. Brause, A. Kemnitz, M. Marangio, A. Pruchnewski, M. Voigt: Sum choice number of generalized Theta-graphs, Discrete Math. 340(11) (2017) 2633-2640

A. Kemnitz, M. Marangio, M. Voigt: Bounds for the sum choice number, Electronic Notes in Discrete Mathematics 63 (2017) 49-58

A. Kemnitz, M. Voigt: A note on non 4-list-colorable planar graphs, The Electron. J. Combin. 25(2) #2.46, 2018

A. Kemnitz, M. Voigt: A note on complex-4-colorability of signed planar graphs, The Electron. J. Combin. 28(2) #2.17, 2021

A.Kemnitz, M.Marangio, Zs. Tuza, M. Voigt: Comparison of sum choice number with chromatic sum, Discrete. Math. 344(7), 2021, 112391