Search the dblp DataBase

Publications of Author

1. Jan Kratochvíl, Zsolt Tuza, Margit Voigt
   On the b-Chromatic Number of Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2002, pp:310-320 [Conf]
   
2. Margit Voigt
   Colouring of distance graphs. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1999, v:52, n:, pp:- [Journal]
   
3. Jochen Harant, Anja Pruchnewski, Margit Voigt
   On Dominating Sets And Independent Sets Of Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 1999, v:8, n:6, pp:- [Journal]
   
4. Margit Voigt
   Algorithmic Aspects Of Partial List Colourings. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2000, v:9, n:4, pp:- [Journal]
   
5. Zsolt Tuza, Margit Voigt
   List Colorings and Reducibility. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:247-256 [Journal]
   
6. Margit Voigt, Hansjoachim Walther
   Chromatic Number of Prime Distance Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:197-209 [Journal]
   
7. Ingo Schiermeyer, Zsolt Tuza, Margit Voigt
   On-line rankings of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:212, n:1-2, pp:141-147 [Journal]
   
8. Zsolt Tuza, Margit Voigt
   A note on planar 5-list colouring: non-extendability at distance 4. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:169-172 [Journal]
   
9. Margit Voigt
   List colourings of planar graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:10-11, pp:1076-1079 [Journal]
   
10. Margit Voigt, Hansjoachim Walther
    Polyhedral graphs with restricted number of faces of the same type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:473-478 [Journal]
    
11. Gábor Bacsó, Zsolt Tuza, Margit Voigt
    Characterization of graphs dominated by induced paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:822-826 [Journal]
    
12. Margit Voigt
    A non-3-choosable planar graph without cycles of length 4 and 5. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:1013-1015 [Journal]
    
13. Margit Voigt
    On the Chromatic Number of Distance Graphs. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1992, v:28, n:1, pp:21-28 [Journal]
    
14. Imre Z. Ruzsa, Zsolt Tuza, Margit Voigt
    Distance Graphs with Finite Chromatic Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:1, pp:181-187 [Journal]
    
15. Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt
    List version of L(d, s)-labelings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:92-98 [Journal]
    
16. Peter Mihók, Jozef Bucko, Margit Voigt
    On uniquely partitionable planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:149-158 [Journal]
    
17. Jan Kratochvíl, Zsolt Tuza, Margit Voigt
    Complexity of choosing subsets from color sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:139-148 [Journal]
    
18. Noga Alon, Zsolt Tuza, Margit Voigt
    Choosability and fractional chromatic numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:31-38 [Journal]
    
19. Margit Voigt
    List colourings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:215-219 [Journal]
    
20. Margit Voigt
    A not 3-choosable planar graph without 3-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:325-328 [Journal]
    
21. 
    Precoloring extension for 2-connected graphs with maximum degree three. [Citation Graph (, )][DBLP]
    
    
22. 
    On list critical graphs. [Citation Graph (, )][DBLP]