Items where Author is "Voigt, M."
 | Up a level |
Number of items: 15.
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2009 | Stiebitz, M. and Tuza, Zsolt and Voigt, M. On list critical graphs | ISI Article | |
| 2007 | Bacsó, Gábor and Tuza, Zsolt and Voigt, M. Characterization of graphs dominated by induced paths | ISI Article | |
| 2005 | Kohl, A. and Schreyer, J. and Tuza, Zsolt and Voigt, M. List version of L(d,s)-labelings | Article | |
| 2002 | Ruzsa, IZ and Tuza, Zsolt and Voigt, M. Distance graphs with finite chromatic number | Article | |
| 2002 | Tuza, Zsolt and Voigt, M. A note on planar 5-list colouring: non-extendability at distance 4 | Article | |
| 2001 | Tuza, Zsolt and Voigt, M. Oriented list colorings of graphs | Article | |
| 2000 | Schiermeyer, I. and Tuza, Zsolt and Voigt, M. On-line rankings of graphs | Article | |
| 1999 | Mihók, P. and Tuza, Zsolt and Voigt, M. Fractional P-colourings and P-choice-ratio | Article | |
| 1999 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M. New trends in the theory of graph colorings: Choosability and list colorings | Conference or Workshop Item | |
| 1999 | Borowiecki, M. and Mihók, P. and Tuza, Zsolt and Voigt, M. Remarks on the existence of uniquely partitionable planar graphs | Article | |
| 1998 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M. Brooks-type theorems for choosability with separation | Article | |
| 1998 | Kratochvíl, J. and Tuza, Zsolt and Voigt, M. Complexity of choosing subsets from color sets | Article | |
| 1997 | Tuza, Zsolt and Voigt, M. List colorings and reducibility | Article | |
| 1996 | Tuza, Zsolt and Voigt, M. Every 2-choosable graph in (2m,m)-choosable | Article | |
| 1996 | Manoussakis, Y. and Spyratos, M. and Tuza, Zsolt and Voigt, M. Minimal colorings for properly colored subgraphs | Article |
