default search action
Margit Voigt
Person information
- affiliation: Technische Universität Ilmenau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j49]Arnfried Kemnitz, Margit Voigt:
A Note on Complex-4-Colorability of Signed Planar Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j48]Arnfried Kemnitz
, Massimiliano Marangio, Zsolt Tuza
Comparison of sum choice number with chromatic sum. Discret. Math. 344(7): 112391 (2021)
2010 – 2019
- 2019
- [j47]Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Generalized sum list colorings of graphs. Discuss. Math. Graph Theory 39(3): 689-703 (2019) - 2018
- [j46]Margit Voigt, Arnfried Kemnitz:
A Note on Not-4-List Colorable Planar Graphs. Electron. J. Comb. 25(2): 2 (2018) - 2017
- [j45]Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt:
Sum choice number of generalized θ-graphs. Discret. Math. 340(11): 2633-2640 (2017) - [j44]Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Bounds for the sum choice number. Electron. Notes Discret. Math. 63: 49-58 (2017) - 2016
- [j43]Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205: 1-7 (2016) - [j42]Igor Fabrici
Facial list colourings of plane graphs. Discret. Math. 339(11): 2826-2831 (2016) - [j41]Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Sum list edge colorings of graphs. Discuss. Math. Graph Theory 36(3): 709-722 (2016) - 2015
- [j40]Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt:
(P, Q)-Total (r, s)-colorings of graphs. Discret. Math. 338(10): 1722-1729 (2015) - [j39]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs Comb. 31(1): 265-280 (2015) - [j38]Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Sum List Colorings of Wheels. Graphs Comb. 31(6): 1905-1913 (2015) - 2013
- [j37]Arnfried Kemnitz, Peter Mihók, Margit Voigt:
Fractional ( P, Q)-total list colorings of graphs. Discuss. Math. Graph Theory 33(1): 167-179 (2013) - 2012
- [j36]Anja Pruchnewski, Margit Voigt:
Weights of induced subgraphs in K1, r-free graphs. Discret. Math. 312(16): 2429-2432 (2012) - [j35]Daniel W. Cranston
List Colorings of K5-Minor-Free Graphs With Special List Assignments. J. Graph Theory 71(1): 18-30 (2012) - 2011
- [j34]Július Czap
Parity vertex colouring of plane graphs. Discret. Math. 311(6): 512-520 (2011)
2000 – 2009
- 2009
- [j33]Margit Voigt:
Precoloring extension for 2-connected graphs with maximum degree three. Discret. Math. 309(15): 4926-4930 (2009) - [j32]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
On list critical graphs. Discret. Math. 309(15): 4931-4941 (2009) - [j31]Anja Pruchnewski, Margit Voigt:
Precoloring extension for K4-minor-free graphs. J. Graph Theory 60(4): 284-294 (2009) - 2007
- [j30]Gábor Bacsó, Zsolt Tuza, Margit Voigt:
Characterization of graphs dominated by induced paths. Discret. Math. 307(7-8): 822-826 (2007) - [j29]Margit Voigt:
A non-3-choosable planar graph without cycles of length 4 and 5. Discret. Math. 307(7-8): 1013-1015 (2007) - [j28]Margit Voigt:
Precoloring Extension for 2-connected Graphs. SIAM J. Discret. Math. 21(1): 258-263 (2007) - 2006
- [j27]Margit Voigt:
List colourings of planar graphs. Discret. Math. 306(10-11): 1076-1079 (2006) - 2005
- [j26]Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt:
List version of L(d, s)-labelings. Theor. Comput. Sci. 349(1): 92-98 (2005) - 2002
- [j25]Margit Voigt, Hansjoachim Walther:
Polyhedral graphs with restricted number of faces of the same type. Discret. Math. 244(1-3): 473-478 (2002) - [j24]Zsolt Tuza, Margit Voigt:
A note on planar 5-list colouring: non-extendability at distance 4. Discret. Math. 251(1-3): 169-172 (2002) - [j23]Jochen Harant, Ingo Schiermeyer, Margit Voigt:
Preface. Discuss. Math. Graph Theory 22(1): 5-6 (2002) - [j22]Imre Z. Ruzsa, Zsolt Tuza, Margit Voigt:
Distance Graphs with Finite Chromatic Number. J. Comb. Theory B 85(1): 181-187 (2002) - [c2]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
On the b-Chromatic Number of Graphs. WG 2002: 310-320 - 2001
- [j21]Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer:
On weights of induced paths and cycles in claw-free and K1, r-free graphs. J. Graph Theory 36(3): 131-143 (2001) - [j20]Zsolt Tuza, Margit Voigt:
Oriented list colorings of graphs. J. Graph Theory 36(4): 217-229 (2001) - 2000
- [j19]Margit Voigt:
Algorithmic Aspects Of Partial List Colourings. Comb. Probab. Comput. 9(4): 375-380 (2000) - [j18]Ingo Schiermeyer, Zsolt Tuza, Margit Voigt:
On-line rankings of graphs. Discret. Math. 212(1-2): 141-147 (2000)
1990 – 1999
- 1999
- [j17]Margit Voigt:
Colouring of distance graphs. Ars Comb. 52 (1999) - [j16]Jochen Harant, Anja Pruchnewski, Margit Voigt:
On Dominating Sets And Independent Sets Of Graphs. Comb. Probab. Comput. 8(6): 547-553 (1999) - [j15]Mieczyslaw Borowiecki, Peter Mihók, Zsolt Tuza, Margit Voigt:
Remarks on the existence of uniquely partitionable planar graphs. Discuss. Math. Graph Theory 19(2): 159-166 (1999) - 1998
- [j14]Jan Kratochvíl
Complexity of choosing subsets from color sets. Discret. Math. 191(1-3): 139-148 (1998) - [j13]Peter Mihók, Jozef Bucko, Margit Voigt:
On uniquely partitionable planar graphs. Discret. Math. 191(1-3): 149-158 (1998) - [j12]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
Brooks-type theorems for choosability with separation. J. Graph Theory 27(1): 43-49 (1998) - 1997
- [j11]Zsolt Tuza, Margit Voigt:
List Colorings and Reducibility. Discret. Appl. Math. 79(1-3): 247-256 (1997) - [j10]Noga Alon, Zsolt Tuza, Margit Voigt:
Choosability and fractional chromatic numbers. Discret. Math. 165-166: 31-38 (1997) - [j9]Margit Voigt, Brunhilde Wirth:
On 3-colorable non-4-choosable planar graphs. J. Graph Theory 24(3): 233-235 (1997) - [c1]Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
New trends in the theory of graph colorings: Choosability and list coloring. Contemporary Trends in Discrete Mathematics 1997: 183-197 - 1996
- [j8]Margit Voigt:
Choosability of planar graphs. Discret. Math. 150(1-3): 457-460 (1996) - [j7]Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt:
Minimal colorings for properly colored subgraphs. Graphs Comb. 12(1): 345-360 (1996) - [j6]Zsolt Tuza, Margit Voigt:
Every 2-choosable graph is (2m, m)-choosable. J. Graph Theory 22(3): 245-252 (1996) - 1995
- [j5]Margit Voigt:
A not 3-choosable planar graph without 3-cycles. Discret. Math. 146(1-3): 325-328 (1995) - 1994
- [j4]Margit Voigt, Hansjoachim Walther:
Chromatic Number of Prime Distance Graphs. Discret. Appl. Math. 51(1-2): 197-209 (1994) - 1993
- [j3]Margit Voigt:
List colourings of planar graphs. Discret. Math. 120(1-3): 215-219 (1993) - 1992
- [j2]Margit Voigt:
On the Chromatic Number of Distance Graphs. J. Inf. Process. Cybern. 28(1): 21-28 (1992) - 1991
- [j1]Margit Voigt, Hansjoachim Walther:
On the chromatic number of special distance graphs. Discret. Math. 97(1-3): 395-397 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: