Margit Voigt

51 papers B 1Journal 49Unranked 1
YearRankTypeTitle / Venue / Authors
2021 J jnl
A Note on Complex-4-Colorability of Signed Planar Graphs.
Electron. J. Comb.
Arnfried Kemnitz, Margit Voigt
2021 J jnl
Comparison of sum choice number with chromatic sum.
Discret. Math.
Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza, Margit Voigt
2019 J jnl
Generalized sum list colorings of graphs.
Discuss. Math. Graph Theory
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt
2018 J jnl
A Note on Not-4-List Colorable Planar Graphs.
Electron. J. Comb.
Margit Voigt, Arnfried Kemnitz
2017 J jnl
Bounds for the sum choice number.
Electron. Notes Discret. Math.
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt
2017 J jnl
Sum choice number of generalized θ-graphs.
Discret. Math.
Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt
2016 J jnl
A note on adjacent vertex distinguishing colorings of graphs.
Discret. Appl. Math.
Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich
2016 J jnl
Facial list colourings of plane graphs.
Discret. Math.
Igor Fabrici, Stanislav Jendrol', Margit Voigt
2016 J jnl
Sum list edge colorings of graphs.
Discuss. Math. Graph Theory
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt
2015 J jnl
(P, Q)-Total (r, s)-colorings of graphs.
Discret. Math.
Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt
2015 J jnl
Orientations of Graphs with Prescribed Weighted Out-Degrees.
Graphs Comb.
Michael Stiebitz, Zsolt Tuza, Margit Voigt
2015 J jnl
Sum List Colorings of Wheels.
Graphs Comb.
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt
2013 J jnl
Fractional (
Discuss. Math. Graph Theory
Arnfried Kemnitz, Peter Mihók, Margit Voigt
2012 J jnl
List Colorings of
J. Graph Theory
Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt
2012 J jnl
Weights of induced subgraphs in K
Discret. Math.
Anja Pruchnewski, Margit Voigt
2011 J jnl
Parity vertex colouring of plane graphs.
Discret. Math.
Július Czap, Stanislav Jendrol', Margit Voigt
2009 J jnl
On list critical graphs.
Discret. Math.
Michael Stiebitz, Zsolt Tuza, Margit Voigt
2009 J jnl
Precoloring extension for
J. Graph Theory
Anja Pruchnewski, Margit Voigt
2009 J jnl
Precoloring extension for 2-connected graphs with maximum degree three.
Discret. Math.
Margit Voigt
2007 J jnl
A non-3-choosable planar graph without cycles of length 4 and 5.
Discret. Math.
Margit Voigt
2007 J jnl
Characterization of graphs dominated by induced paths.
Discret. Math.
Gábor Bacsó, Zsolt Tuza, Margit Voigt
2007 J jnl
Precoloring Extension for 2-connected Graphs.
SIAM J. Discret. Math.
Margit Voigt
2006 J jnl
List colourings of planar graphs.
Discret. Math.
Margit Voigt
2005 J jnl
List version of
Theor. Comput. Sci.
Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt
2002 J jnl
A note on planar 5-list colouring: non-extendability at distance 4.
Discret. Math.
Zsolt Tuza, Margit Voigt
2002 J jnl
Distance Graphs with Finite Chromatic Number.
J. Comb. Theory B
Imre Z. Ruzsa, Zsolt Tuza, Margit Voigt
2002 B conf
On the b-Chromatic Number of Graphs.
WG
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
2002 J jnl
Polyhedral graphs with restricted number of faces of the same type.
Discret. Math.
Margit Voigt, Hansjoachim Walther
2002 J jnl
Preface.
Discuss. Math. Graph Theory
Jochen Harant, Ingo Schiermeyer, Margit Voigt
2001 J jnl
On weights of induced paths and cycles in claw-free and
J. Graph Theory
Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer
2001 J jnl
Oriented list colorings of graphs.
J. Graph Theory
Zsolt Tuza, Margit Voigt
2000 J jnl
Algorithmic Aspects Of Partial List Colourings.
Comb. Probab. Comput.
Margit Voigt
2000 J jnl
On-line rankings of graphs.
Discret. Math.
Ingo Schiermeyer, Zsolt Tuza, Margit Voigt
1999 J jnl
Colouring of distance graphs.
Ars Comb.
Margit Voigt
1999 J jnl
On Dominating Sets And Independent Sets Of Graphs.
Comb. Probab. Comput.
Jochen Harant, Anja Pruchnewski, Margit Voigt
1999 J jnl
Remarks on the existence of uniquely partitionable planar graphs.
Discuss. Math. Graph Theory
Mieczyslaw Borowiecki, Peter Mihók, Zsolt Tuza, Margit Voigt
1998 J jnl
Brooks-type theorems for choosability with separation.
J. Graph Theory
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1998 J jnl
Complexity of choosing subsets from color sets.
Discret. Math.
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1998 J jnl
On uniquely partitionable planar graphs.
Discret. Math.
Peter Mihók, Jozef Bucko, Margit Voigt
1997 J jnl
Choosability and fractional chromatic numbers.
Discret. Math.
Noga Alon, Zsolt Tuza, Margit Voigt
1997 J jnl
List Colorings and Reducibility.
Discret. Appl. Math.
Zsolt Tuza, Margit Voigt
1997 — conf
New trends in the theory of graph colorings: Choosability and list coloring.
Contemporary Trends in Discrete Mathematics
Jan Kratochvíl, Zsolt Tuza, Margit Voigt
1997 J jnl
On 3-colorable non-4-choosable planar graphs.
J. Graph Theory
Margit Voigt, Brunhilde Wirth
1996 J jnl
Choosability of planar graphs.
Discret. Math.
Margit Voigt
1996 J jnl
Every 2-choosable graph is (2
J. Graph Theory
Zsolt Tuza, Margit Voigt
1996 J jnl
Minimal colorings for properly colored subgraphs.
Graphs Comb.
Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt
1995 J jnl
A not 3-choosable planar graph without 3-cycles.
Discret. Math.
Margit Voigt
1994 J jnl
Chromatic Number of Prime Distance Graphs.
Discret. Appl. Math.
Margit Voigt, Hansjoachim Walther
1993 J jnl
List colourings of planar graphs.
Discret. Math.
Margit Voigt
1992 J jnl
On the Chromatic Number of Distance Graphs.
J. Inf. Process. Cybern.
Margit Voigt
1991 J jnl
On the chromatic number of special distance graphs.
Discret. Math.
Margit Voigt, Hansjoachim Walther