Michael Stiebitz

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 18

Top Topics

Preferential Attachment

Graphical Representation

Top Venues

J. Graph Theory

Electron. J. Comb.

Publications

Lucas Picasarri-Arrieta, Michael Stiebitz
Minimum number of arcs in k-critical digraphs with order at most 2k - 1. Discret. Math. 347 (9) (2024)
Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz
Generalized DP-colorings of graphs. Discret. Math. 346 (11) (2023)
Lucas Picasarri-Arrieta, Michael Stiebitz
Minimum number of arcs in k-critical digraphs with order at most 2k-1. CoRR (2023)
Justus von Postel, Thomas Schweser, Michael Stiebitz
Point Partition Numbers: Perfect Graphs. Graphs Comb. 38 (2) (2022)
Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz
Digraphs and Variable Degeneracy. SIAM J. Discret. Math. 36 (1) (2022)
Justus von Postel, Thomas Schweser, Michael Stiebitz
Point partition numbers: Decomposable and indecomposable critical graphs. Discret. Math. 345 (8) (2022)
Thomas Schweser, Michael Stiebitz
Partitions of hypergraphs under variable degeneracy constraints. J. Graph Theory 96 (1) (2021)
Thomas Schweser, Michael Stiebitz
Vertex partition of hypergraphs and maximum degenerate subhypergraphs. Electron. J. Graph Theory Appl. 9 (1) (2021)
Alexandr V. Kostochka, Michael Stiebitz
The Minimum Number of Edges in 4-Critical Digraphs of Given Order. Graphs Comb. 36 (3) (2020)
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
On DP-coloring of digraphs. J. Graph Theory 95 (1) (2020)
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz
Hajós and Ore Constructions for Digraphs. Electron. J. Comb. 27 (1) (2020)
Yan Cao, Guantao Chen, Guangming Jing, Michael Stiebitz, Bjarne Toft
Graph Edge Coloring: A Survey. Graphs Comb. 35 (1) (2019)
Thomas Schweser, Michael Stiebitz
Partitions of multigraphs under minimum degree constraints. Discret. Appl. Math. 257 (2019)
Michael Stiebitz, Bjarne Toft
A Brooks Type Theorem for the Maximum Local Edge Connectivity. Electron. J. Comb. 25 (1) (2018)
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
Horst Sachs (1927-2016). Discret. Math. 340 (11) (2017)
Michael Stiebitz
A Relaxed Version of the Erdős-Lovász Tihany Conjecture. J. Graph Theory 85 (1) (2017)
Thomas Schweser, Michael Stiebitz
Degree choosable signed graphs. Discret. Math. 340 (5) (2017)
Michael Stiebitz, Zsolt Tuza, Margit Voigt
Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs Comb. 31 (1) (2015)
Diego Scheide, Michael Stiebitz
The Maximum Chromatic Index of Multigraphs with Given Δ and μ. Graphs Comb. 28 (5) (2012)
Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz
Graphs with chromatic number close to maximum degree. Discret. Math. 312 (6) (2012)
Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall
Ohba's conjecture for graphs with independence number five. Discret. Math. 311 (12) (2011)
Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz
Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory, Ser. B 100 (6) (2010)
Diego Scheide, Michael Stiebitz
Vizing's coloring algorithm and the fan number. J. Graph Theory 65 (2) (2010)
Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz
Edge colouring by total labellings. Discret. Math. 310 (2) (2010)
Michael Stiebitz, Zsolt Tuza, Margit Voigt
On list critical graphs. Discret. Math. 309 (15) (2009)
Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discret. Math. 23 (3) (2009)
József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz
The Erdos-Lovász Tihany conjecture for quasi-line graphs. Discret. Math. 309 (12) (2009)
Diego Scheide, Michael Stiebitz
On Vizing's bound for the chromatic index of a multigraph. Discret. Math. 309 (15) (2009)
Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz
List colorings with measurable sets. J. Graph Theory 59 (3) (2008)
Alexandr V. Kostochka, Michael Stiebitz
Partitions and Edge Colourings of Multigraphs. Electron. J. Comb. 15 (1) (2008)
Thomas Böhme, Tobias Gerlach, Michael Stiebitz
Ordered and linked chordal graphs. Discuss. Math. Graph Theory 28 (2) (2008)
Michael Stiebitz, Riste Skrekovski
A map colour theorem for the union of graphs. J. Comb. Theory, Ser. B 96 (1) (2006)
V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
Deeply asymmetric planar graphs. J. Comb. Theory, Ser. B 95 (1) (2005)
Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West
Nordhaus-Gaddum-type Theorems for decompositions into many parts. J. Graph Theory 50 (4) (2005)
Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
-connected graphs. J. Graph Theory 45 (4) (2004)
András Gyárfás, Tommy Jensen, Michael Stiebitz
On graphs with strongly independent color-classes. J. Graph Theory 46 (1) (2004)
Alexandr V. Kostochka, Michael Stiebitz
A new lower bound on the number of edges in colour-critical graphs and hypergraphs. J. Comb. Theory, Ser. B 87 (2) (2003)
Michael D. Plummer, Michael Stiebitz, Bjarne Toft
On a special case of Hadwiger's conjecture. Discuss. Math. Graph Theory 23 (2) (2003)
Alexandr V. Kostochka, Michael Stiebitz
A list version of Dirac's theorem on the number of edges in colour-critical graphs. J. Graph Theory 39 (3) (2002)
Alexandr V. Kostochka, Michael Stiebitz
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. Comb. 20 (4) (2000)
Thomas Böhme, Bojan Mohar, Michael Stiebitz
Dirac's map-color theorem for choosability. J. Graph Theory 32 (4) (1999)
Alexandr V. Kostochka, Michael Stiebitz
Colour-critical graphs with few edges. Discret. Math. 191 (1-3) (1998)
Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170 (1-3) (1997)
Alexandr V. Kostochka, Michael Stiebitz, Brunhilde Wirth
The colour theorems of Brooks and Gallai extended. Discret. Math. 162 (1-3) (1996)
Michael Stiebitz
Decomposing graphs under degree constraints. J. Graph Theory 23 (3) (1996)
Michael Stiebitz, Bjarne Toft
An Abstract Generalization of a Map Reduction Theorem of Birkhoff. J. Comb. Theory, Ser. B 65 (2) (1995)
Michael Stiebitz
The forest plus stars colouring problem. Discret. Math. 126 (1-3) (1994)
Michael Stiebitz
On Hadwiger's number - a problem of the Nordhaus-Gaddum type. Discret. Math. 101 (1-3) (1992)
Herbert Fleischner, Michael Stiebitz
A solution to a colouring problem of P. Erdös. Discret. Math. 101 (1-3) (1992)
U. Hendrich, Michael Stiebitz
On the Bandwidth of Graph Products. J. Inf. Process. Cybern. 28 (3) (1992)
Horst Sachs, Michael Stiebitz
On constructive methods in the theory of colour-critical graphs. Discret. Math. 74 (1-2) (1989)
Horst Sachs, Michael Stiebitz, Robin J. Wilson
An historical note: Euler's Königsberg letters. J. Graph Theory 12 (1) (1988)
Michael Stiebitz
is the only double-critical 5-chromatic graph. Discret. Math. 64 (1) (1987)
Michael Stiebitz
Subgraphs of color-critical graphs. Comb. 7 (3) (1987)
Michael Stiebitz
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. Comb. 2 (3) (1982)