Michael Stiebitz

1.1k total citations
51 papers, 555 citations indexed

About

Michael Stiebitz is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Michael Stiebitz has authored 51 papers receiving a total of 555 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computational Theory and Mathematics, 37 papers in Discrete Mathematics and Combinatorics and 11 papers in Geometry and Topology. Recurrent topics in Michael Stiebitz's work include Advanced Graph Theory Research (43 papers), Limits and Structures in Graph Theory (37 papers) and Graph Labeling and Dimension Problems (32 papers). Michael Stiebitz is often cited by papers focused on Advanced Graph Theory Research (43 papers), Limits and Structures in Graph Theory (37 papers) and Graph Labeling and Dimension Problems (32 papers). Michael Stiebitz collaborates with scholars based in Germany, Russia and United States. Michael Stiebitz's co-authors include Alexandr Kostochka, Herbert Fleischner, Bjarne Toft, Bojan Mohar, Brunhilde Wirth, H. Sachs, Michael D. Plummer, Thomas Böhme, András Gyárfás and Torben R. Jensen and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Michael Stiebitz

44 papers receiving 515 citations

Peers

Michael Stiebitz

CTM

DMC

GT

EEE

CNC

Jochen Harant Germany

Florian Pfender United States

Daniel W. Cranston United States

Stephen C. Locke United States

Tomáš Kaiser Czechia

Garry L. Johns United States

Jarosław Grytczuk Poland

Kenta Ozeki Japan

Norbert Sauer Canada

Bert L. Hartnell Canada

Jochen Harant Germany

Michael Stiebitz

408 ×0.8

CTM

151 ×0.4

DMC

112 ×0.7

GT

75 ×0.9

EEE

68 ×1.7

CNC

Citations per year, relative to Michael Stiebitz Michael Stiebitz (= 1×) peers Jochen Harant

Countries citing papers authored by Michael Stiebitz

Since Specialization

Citations

This map shows the geographic impact of Michael Stiebitz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Stiebitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Stiebitz more than expected).

Fields of papers citing papers by Michael Stiebitz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Stiebitz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Stiebitz. The network helps show where Michael Stiebitz may publish in the future.

Co-authorship network of co-authors of Michael Stiebitz

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Stiebitz. A scholar is included among the top collaborators of Michael Stiebitz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Stiebitz. Michael Stiebitz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Stiebitz, Michael, et al.. (2024). Minimum number of arcs in k-critical digraphs with order at most 2k − 1. Discrete Mathematics. 347(9). 114072–114072.

2.

Stiebitz, Michael, et al.. (2024). Brooks' Theorem. Springer monographs in mathematics.

3.

Stiebitz, Michael, et al.. (2018). Partitions of multigraphs under minimum degree constraints. Discrete Applied Mathematics. 257. 269–275. 8 indexed citations

4.

Stiebitz, Michael, Źsolt Tuza, & Margit Voigt. (2013). Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs and Combinatorics. 31(1). 265–280. 1 indexed citations

5.

Kostochka, Alexandr, Michael Stiebitz, & Douglas R. Woodall. (2011). Ohba’s conjecture for graphs with independence number five. Discrete Mathematics. 311(12). 996–1005. 6 indexed citations

6.

Král͏̌, Daniel, et al.. (2010). Graphs with bounded tree-width and large odd-girth are almost bipartite. Journal of Combinatorial Theory Series B. 100(6). 554–559. 1 indexed citations

7.

Brandt, Stephan, et al.. (2008). Edge colouring by total labellings. Discrete Mathematics. 310(2). 199–205. 5 indexed citations

8.

Stiebitz, Michael, Źsolt Tuza, & Margit Voigt. (2008). On list critical graphs. Discrete Mathematics. 309(15). 4931–4941. 1 indexed citations

9.

Balogh, József, et al.. (2008). The Erdős–Lovász Tihany conjecture for quasi-line graphs. Discrete Mathematics. 309(12). 3985–3991. 7 indexed citations

10.

Borodin, O. V., et al.. (2005). Deeply asymmetric planar graphs. Journal of Combinatorial Theory Series B. 95(1). 68–78. 2 indexed citations

11.

Kostochka, Alexandr & Michael Stiebitz. (2003). A new lower bound on the number of edges in colour-critical graphs and hypergraphs. Journal of Combinatorial Theory Series B. 87(2). 374–402. 11 indexed citations

12.

Böhme, Thomas, Bojan Mohar, & Michael Stiebitz. (1999). Dirac's map-color theorem for choosability. Journal of Graph Theory. 32(4). 327–339. 23 indexed citations

13.

Böhme, Thomas, Hajo Broersma, F. Göbel, Alexandr Kostochka, & Michael Stiebitz. (1997). Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics. 170(1-3). 219–222. 8 indexed citations

14.

Kostochka, Alexandr, Michael Stiebitz, & Brunhilde Wirth. (1996). The colour theorems of Brooks and Gallai extended. Discrete Mathematics. 162(1-3). 299–303. 45 indexed citations

15.

Stiebitz, Michael & Bjarne Toft. (1995). An Abstract Generalization of a Map Reduction Theorem of Birkhoff. Journal of Combinatorial Theory Series B. 65(2). 165–185. 1 indexed citations

16.

Stiebitz, Michael. (1994). The forest plus stars colouring problem. Discrete Mathematics. 126(1-3). 385–389. 3 indexed citations

17.

Stiebitz, Michael, et al.. (1992). On the bandwidth of graph products. Journal of automata, languages and combinatorics. 28(3). 113–125. 13 indexed citations

18.

Fleischner, Herbert & Michael Stiebitz. (1992). A solution to a colouring problem of P. Erdős. Discrete Mathematics. 101(1-3). 39–48. 45 indexed citations

19.

Sachs, H. & Michael Stiebitz. (1989). On constructive methods in the theory of colour-critical graphs. Discrete Mathematics. 74(1-2). 201–226. 13 indexed citations

20.

Stiebitz, Michael. (1987). K5 is the only double-critical 5-chromatic graph. Discrete Mathematics. 64(1). 91–93. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact