The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Stiebitz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexandr V. Kostochka, Michael Stiebitz
    On the Number of Edges in Colour-Critical Graphs and Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:521-530 [Journal]
  2. Michael Stiebitz
    Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:315-323 [Journal]
  3. Michael Stiebitz
    Subgraphs of color-critical graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:3, pp:303-312 [Journal]
  4. U. Hendrich, Michael Stiebitz
    On the Bandwidth of Graph Products. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1992, v:28, n:3, pp:113-125 [Journal]
  5. V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
    Deeply asymmetric planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:68-78 [Journal]
  6. Alexandr V. Kostochka, Michael Stiebitz
    A new lower bound on the number of edges in colour-critical graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:374-402 [Journal]
  7. Michael Stiebitz, Riste Skrekovski
    A map colour theorem for the union of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:1, pp:20-37 [Journal]
  8. Michael Stiebitz, Bjarne Toft
    An Abstract Generalization of a Map Reduction Theorem of Birkhoff. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:2, pp:165-185 [Journal]
  9. Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West
    Nordhaus-Gaddum-type Theorems for decompositions into many parts. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:4, pp:273-292 [Journal]
  10. András Gyárfás, T. Jensen, Michael Stiebitz
    On graphs with strongly independent color-classes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:1, pp:1-14 [Journal]
  11. Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
    Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:4, pp:270-274 [Journal]
  12. Michael Stiebitz
    K5 is the only double-critical 5-chromatic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:91-93 [Journal]
  13. Horst Sachs, Michael Stiebitz
    On constructive methods in the theory of colour-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:201-226 [Journal]
  14. Alexandr V. Kostochka, Michael Stiebitz
    Colour-critical graphs with few edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:125-137 [Journal]
  15. Alexandr V. Kostochka, Michael Stiebitz, B. Wirth
    The colour theorems of Brooks and Gallai extended. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:299-303 [Journal]
  16. Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
    Spanning trees with pairwise nonadjacent endvertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:219-222 [Journal]
  17. Michael Stiebitz
    On Hadwiger's number - a problem of the Nordhaus-Gaddum type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:307-317 [Journal]
  18. Herbert Fleischner, Michael Stiebitz
    A solution to a colouring problem of P. Erdös. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:39-48 [Journal]

  19. The Erdos-Lovász Tihany conjecture for quasi-line graphs. [Citation Graph (, )][DBLP]


  20. On Vizing's bound for the chromatic index of a multigraph. [Citation Graph (, )][DBLP]


  21. On list critical graphs. [Citation Graph (, )][DBLP]


  22. Edge colouring by total labellings. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002