Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. - Michael Stiebitz (Comb., 1982)

Subgraphs of color-critical graphs. - Michael Stiebitz (Comb., 1987)

K5 is the only double-critical 5-chromatic graph. - Michael Stiebitz (Discret. Math., 1987)

An historical note: Euler's Königsberg letters. - Horst Sachs; Michael Stiebitz; Robin J. Wilson (J. Graph Theory, 1988)

On constructive methods in the theory of colour-critical graphs. - Horst Sachs; Michael Stiebitz (Discret. Math., 1989)

A solution to a colouring problem of P. Erdös. - Herbert Fleischner; Michael Stiebitz (Discret. Math., 1992)

On Hadwiger's number - a problem of the Nordhaus-Gaddum type. - Michael Stiebitz (Discret. Math., 1992)

On the Bandwidth of Graph Products. - U. Hendrich; Michael Stiebitz (J. Inf. Process. Cybern., 1992)

The forest plus stars colouring problem. - Michael Stiebitz (Discret. Math., 1994)

An Abstract Generalization of a Map Reduction Theorem of Birkhoff. - Michael Stiebitz; Bjarne Toft (J. Comb. Theory B, 1995)

The colour theorems of Brooks and Gallai extended. - Alexandr V. Kostochka; Michael Stiebitz; Brunhilde Wirth (Discret. Math., 1996)

Decomposing graphs under degree constraints. - Michael Stiebitz (J. Graph Theory, 1996)

Spanning trees with pairwise nonadjacent endvertices. - Thomas Böhme 001; Hajo Broersma; F. Göbel; Alexandr V. Kostochka; Michael Stiebitz (Discret. Math., 1997)

Colour-critical graphs with few edges. - Alexandr V. Kostochka; Michael Stiebitz (Discret. Math., 1998)

Dirac's map-color theorem for choosability. - Thomas Böhme 001; Bojan Mohar; Michael Stiebitz (J. Graph Theory, 1999)

On the Number of Edges in Colour-Critical Graphs and Hypergraphs. - Alexandr V. Kostochka; Michael Stiebitz (Comb., 2000)

A list version of Dirac's theorem on the number of edges in colour-critical graphs. - Alexandr V. Kostochka; Michael Stiebitz (J. Graph Theory, 2002)

On a special case of Hadwiger's conjecture. - Michael D. Plummer; Michael Stiebitz; Bjarne Toft (Discuss. Math. Graph Theory, 2003)

A new lower bound on the number of edges in colour-critical graphs and hypergraphs. - Alexandr V. Kostochka; Michael Stiebitz (J. Comb. Theory B, 2003)

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. - Thomas Böhme 001; Bojan Mohar; Riste Skrekovski; Michael Stiebitz (J. Graph Theory, 2004)

On graphs with strongly independent color-classes. - András Gyárfás; Tommy Jensen; Michael Stiebitz (J. Graph Theory, 2004)

Deeply asymmetric planar graphs. - V. A. Aksionov; Oleg V. Borodin; Leonid S. Melnikov; Gert Sabidussi; Michael Stiebitz; Bjarne Toft (J. Comb. Theory B, 2005)

Nordhaus-Gaddum-type Theorems for decompositions into many parts. - Zoltán Füredi; Alexandr V. Kostochka; Riste Skrekovski; Michael Stiebitz; Douglas B. West (J. Graph Theory, 2005)

A map colour theorem for the union of graphs. - Michael Stiebitz; Riste Skrekovski (J. Comb. Theory B, 2006)

Partitions and Edge Colourings of Multigraphs. - Alexandr V. Kostochka; Michael Stiebitz (Electron. J. Comb., 2008)

Ordered and linked chordal graphs. - Thomas Böhme 001; Tobias Gerlach; Michael Stiebitz (Discuss. Math. Graph Theory, 2008)

List colorings with measurable sets. - Jan Hladký; Daniel Král; Jean-Sébastien Sereni; Michael Stiebitz (J. Graph Theory, 2008)

The Erdos-Lovász Tihany conjecture for quasi-line graphs. - József Balogh; Alexandr V. Kostochka; Noah Prince; Michael Stiebitz (Discret. Math., 2009)

On Vizing's bound for the chromatic index of a multigraph. - Diego Scheide; Michael Stiebitz (Discret. Math., 2009)

On list critical graphs. - Michael Stiebitz; Zsolt Tuza; Margit Voigt (Discret. Math., 2009)

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. - Daniel Král; Jean-Sébastien Sereni; Michael Stiebitz (SIAM J. Discret. Math., 2009)

Edge colouring by total labellings. - Stephan Brandt; Kristína Budajová; Dieter Rautenbach; Michael Stiebitz (Discret. Math., 2010)

Graphs with bounded tree-width and large odd-girth are almost bipartite. - Alexandr V. Kostochka; Daniel Král'; Jean-Sébastien Sereni; Michael Stiebitz (J. Comb. Theory B, 2010)

Vizing's coloring algorithm and the fan number. - Diego Scheide; Michael Stiebitz (J. Graph Theory, 2010)

Ohba's conjecture for graphs with independence number five. - Alexandr V. Kostochka; Michael Stiebitz; Douglas R. Woodall (Discret. Math., 2011)

Graphs with chromatic number close to maximum degree. - Alexandr V. Kostochka; Landon Rabern; Michael Stiebitz (Discret. Math., 2012)

The Maximum Chromatic Index of Multigraphs with Given Δ and μ. - Diego Scheide; Michael Stiebitz (Graphs Comb., 2012)

Some Remarks on the Cycle Plus Triangles Problem. - Herbert Fleischner; Michael Stiebitz (The Mathematics of Paul Erdős II, 2013)

Orientations of Graphs with Prescribed Weighted Out-Degrees. - Michael Stiebitz; Zsolt Tuza; Margit Voigt (Graphs Comb., 2015)

Horst Sachs (1927-2016). - Thomas Böhme 001; Jochen Harant; Matthias Kriesell; Michael Stiebitz (Discret. Math., 2017)

Degree choosable signed graphs. - Thomas Schweser; Michael Stiebitz (Discret. Math., 2017)

A Relaxed Version of the Erdős-Lovász Tihany Conjecture. - Michael Stiebitz (J. Graph Theory, 2017)

A Brooks Type Theorem for the Maximum Local Edge Connectivity. - Michael Stiebitz; Bjarne Toft (Electron. J. Comb., 2018)

Partitions of multigraphs under minimum degree constraints. - Thomas Schweser; Michael Stiebitz (Discret. Appl. Math., 2019)

Graph Edge Coloring: A Survey. - Yan Cao 001; Guantao Chen; Guangming Jing; Michael Stiebitz; Bjarne Toft (Graphs Comb., 2019)

Hajós and Ore Constructions for Digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (Electron. J. Comb., 2020)

The Minimum Number of Edges in 4-Critical Digraphs of Given Order. - Alexandr V. Kostochka; Michael Stiebitz (Graphs Comb., 2020)

On DP-coloring of digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (J. Graph Theory, 2020)

Vertex partition of hypergraphs and maximum degenerate subhypergraphs. - Thomas Schweser; Michael Stiebitz (Electron. J. Graph Theory Appl., 2021)

Partitions of hypergraphs under variable degeneracy constraints. - Thomas Schweser; Michael Stiebitz (J. Graph Theory, 2021)

Point partition numbers: Decomposable and indecomposable critical graphs. - Justus von Postel; Thomas Schweser; Michael Stiebitz (Discret. Math., 2022)

Point Partition Numbers: Perfect Graphs. - Justus von Postel; Thomas Schweser; Michael Stiebitz (Graphs Comb., 2022)

Digraphs and Variable Degeneracy. - Jørgen Bang-Jensen; Thomas Schweser; Michael Stiebitz (SIAM J. Discret. Math., 2022)

Minimum number of arcs in k-critical digraphs with order at most 2k-1. - Lucas Picasarri-Arrieta; Michael Stiebitz (CoRR, 2023)

Generalized DP-colorings of graphs. - Alexandr V. Kostochka; Thomas Schweser; Michael Stiebitz (Discret. Math., 2023)

Minimum number of arcs in k-critical digraphs with order at most 2k - 1. - Lucas Picasarri-Arrieta; Michael Stiebitz (Discret. Math., 2024)