On the chromatic number of special distance graphs. - Margit Voigt; Hansjoachim Walther (Discret. Math., 1991)

On the Chromatic Number of Distance Graphs. - Margit Voigt (J. Inf. Process. Cybern., 1992)

Chromatic Number of Prime Distance Graphs. - Margit Voigt; Hansjoachim Walther (Discret. Appl. Math., 1994)

A not 3-choosable planar graph without 3-cycles. - Margit Voigt (Discret. Math., 1995)

Choosability of planar graphs. - Margit Voigt (Discret. Math., 1996)

Minimal colorings for properly colored subgraphs. - Yannis Manoussakis; Michael Spyratos; Zsolt Tuza; Margit Voigt (Graphs Comb., 1996)

Every 2-choosable graph is (2m, m)-choosable. - Zsolt Tuza; Margit Voigt (J. Graph Theory, 1996)

New trends in the theory of graph colorings: Choosability and list coloring. - Jan Kratochvíl; Zsolt Tuza; Margit Voigt (Contemporary Trends in Discrete Mathematics, 1997)

List Colorings and Reducibility. - Zsolt Tuza; Margit Voigt (Discret. Appl. Math., 1997)

Choosability and fractional chromatic numbers. - Noga Alon; Zsolt Tuza; Margit Voigt (Discret. Math., 1997)

On 3-colorable non-4-choosable planar graphs. - Margit Voigt; Brunhilde Wirth (J. Graph Theory, 1997)

Complexity of choosing subsets from color sets. - Jan Kratochvíl; Zsolt Tuza; Margit Voigt (Discret. Math., 1998)

On uniquely partitionable planar graphs. - Peter Mihók; Jozef Bucko; Margit Voigt (Discret. Math., 1998)

Brooks-type theorems for choosability with separation. - Jan Kratochvíl; Zsolt Tuza; Margit Voigt (J. Graph Theory, 1998)

Colouring of distance graphs. - Margit Voigt (Ars Comb., 1999)

On Dominating Sets And Independent Sets Of Graphs. - Jochen Harant; Anja Pruchnewski; Margit Voigt (Comb. Probab. Comput., 1999)

Remarks on the existence of uniquely partitionable planar graphs. - Mieczyslaw Borowiecki; Peter Mihók; Zsolt Tuza; Margit Voigt (Discuss. Math. Graph Theory, 1999)

Algorithmic Aspects Of Partial List Colourings. - Margit Voigt (Comb. Probab. Comput., 2000)

On-line rankings of graphs. - Ingo Schiermeyer; Zsolt Tuza; Margit Voigt (Discret. Math., 2000)

On weights of induced paths and cycles in claw-free and K1, r-free graphs. - Jochen Harant; Margit Voigt; Stanislav Jendrol'; Bert Randerath; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 2001)

Oriented list colorings of graphs. - Zsolt Tuza; Margit Voigt (J. Graph Theory, 2001)

On the b-Chromatic Number of Graphs. - Jan Kratochvíl; Zsolt Tuza; Margit Voigt (WG, 2002)

A note on planar 5-list colouring: non-extendability at distance 4. - Zsolt Tuza; Margit Voigt (Discret. Math., 2002)

Polyhedral graphs with restricted number of faces of the same type. - Margit Voigt; Hansjoachim Walther (Discret. Math., 2002)

Preface. - Jochen Harant; Ingo Schiermeyer; Margit Voigt (Discuss. Math. Graph Theory, 2002)

Distance Graphs with Finite Chromatic Number. - Imre Z. Ruzsa; Zsolt Tuza; Margit Voigt (J. Comb. Theory B, 2002)

List version of L(d, s)-labelings. - Anja Kohl; Jens Schreyer; Zsolt Tuza; Margit Voigt (Theor. Comput. Sci., 2005)

List colourings of planar graphs. - Margit Voigt (Discret. Math., 2006)

Characterization of graphs dominated by induced paths. - Gábor Bacsó; Zsolt Tuza; Margit Voigt (Discret. Math., 2007)

A non-3-choosable planar graph without cycles of length 4 and 5. - Margit Voigt (Discret. Math., 2007)

Precoloring Extension for 2-connected Graphs. - Margit Voigt (SIAM J. Discret. Math., 2007)

On list critical graphs. - Michael Stiebitz; Zsolt Tuza; Margit Voigt (Discret. Math., 2009)

Precoloring extension for 2-connected graphs with maximum degree three. - Margit Voigt (Discret. Math., 2009)

Precoloring extension for K4-minor-free graphs. - Anja Pruchnewski; Margit Voigt (J. Graph Theory, 2009)

Parity vertex colouring of plane graphs. - Július Czap; Stanislav Jendrol'; Margit Voigt (Discret. Math., 2011)

Weights of induced subgraphs in K1, r-free graphs. - Anja Pruchnewski; Margit Voigt (Discret. Math., 2012)

List Colorings of K5-Minor-Free Graphs With Special List Assignments. - Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt (J. Graph Theory, 2012)

Fractional ( P, Q)-total list colorings of graphs. - Arnfried Kemnitz; Peter Mihók; Margit Voigt (Discuss. Math. Graph Theory, 2013)

(P, Q)-Total (r, s)-colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Anja Pruchnewski; Margit Voigt (Discret. Math., 2015)

Sum List Colorings of Wheels. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Graphs Comb., 2015)

Orientations of Graphs with Prescribed Weighted Out-Degrees. - Michael Stiebitz; Zsolt Tuza; Margit Voigt (Graphs Comb., 2015)

A note on adjacent vertex distinguishing colorings of graphs. - Maria Axenovich; Jochen Harant; Jakub Przybylo; Roman Soták; Margit Voigt; Jenny Weidelich (Discret. Appl. Math., 2016)

Facial list colourings of plane graphs. - Igor Fabrici; Stanislav Jendrol'; Margit Voigt (Discret. Math., 2016)

Sum list edge colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Discuss. Math. Graph Theory, 2016)

Sum choice number of generalized θ-graphs. - Christoph Brause; Arnfried Kemnitz; Massimiliano Marangio; Anja Pruchnewski; Margit Voigt (Discret. Math., 2017)

Bounds for the sum choice number. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Electron. Notes Discret. Math., 2017)

A Note on Not-4-List Colorable Planar Graphs. - Margit Voigt; Arnfried Kemnitz (Electron. J. Comb., 2018)

Generalized sum list colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Discuss. Math. Graph Theory, 2019)

A Note on Complex-4-Colorability of Signed Planar Graphs. - Arnfried Kemnitz; Margit Voigt (Electron. J. Comb., 2021)

Comparison of sum choice number with chromatic sum. - Arnfried Kemnitz; Massimiliano Marangio; Zsolt Tuza; Margit Voigt (Discret. Math., 2021)