Michael Stiebitz

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