default search action
Michael Stiebitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j54]Lucas Picasarri-Arrieta
, Michael Stiebitz:
Minimum number of arcs in k-critical digraphs with order at most 2k - 1. Discret. Math. 347(9): 114072 (2024) - 2023
- [j53]Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz:
Generalized DP-colorings of graphs. Discret. Math. 346(11): 113186 (2023) - [i1]Lucas Picasarri-Arrieta, Michael Stiebitz:
Minimum number of arcs in k-critical digraphs with order at most 2k-1. CoRR abs/2310.03584 (2023) - 2022
- [j52]Justus von Postel, Thomas Schweser, Michael Stiebitz:
Point partition numbers: Decomposable and indecomposable critical graphs. Discret. Math. 345(8): 112903 (2022) - [j51]Justus von Postel, Thomas Schweser
Point Partition Numbers: Perfect Graphs. Graphs Comb. 38(2): 31 (2022) - [j50]Jørgen Bang-Jensen
Digraphs and Variable Degeneracy. SIAM J. Discret. Math. 36(1): 578-595 (2022) - 2021
- [j49]Thomas Schweser
Vertex partition of hypergraphs and maximum degenerate subhypergraphs. Electron. J. Graph Theory Appl. 9(1): 1-9 (2021) - [j48]Thomas Schweser
Partitions of hypergraphs under variable degeneracy constraints. J. Graph Theory 96(1): 7-33 (2021) - 2020
- [j47]Jørgen Bang-Jensen
Hajós and Ore Constructions for Digraphs. Electron. J. Comb. 27(1): 1 (2020) - [j46]Alexandr V. Kostochka, Michael Stiebitz
The Minimum Number of Edges in 4-Critical Digraphs of Given Order. Graphs Comb. 36(3): 703-718 (2020) - [j45]Jørgen Bang-Jensen
On DP-coloring of digraphs. J. Graph Theory 95(1): 76-98 (2020)
2010 – 2019
- 2019
- [j44]Thomas Schweser
Partitions of multigraphs under minimum degree constraints. Discret. Appl. Math. 257: 269-275 (2019) - [j43]Yan Cao, Guantao Chen, Guangming Jing
Graph Edge Coloring: A Survey. Graphs Comb. 35(1): 33-66 (2019) - 2018
- [j42]Michael Stiebitz, Bjarne Toft:
A Brooks Type Theorem for the Maximum Local Edge Connectivity. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j41]Thomas Schweser
Degree choosable signed graphs. Discret. Math. 340(5): 882-891 (2017) - [j40]Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz:
Horst Sachs (1927-2016). Discret. Math. 340(11): 2615 (2017) - [j39]Michael Stiebitz:
A Relaxed Version of the Erdős-Lovász Tihany Conjecture. J. Graph Theory 85(1): 278-287 (2017) - 2015
- [j38]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs Comb. 31(1): 265-280 (2015) - 2013
- [p1]Herbert Fleischner, Michael Stiebitz:
Some Remarks on the Cycle Plus Triangles Problem. The Mathematics of Paul Erdős II 2013: 119-125 - 2012
- [j37]Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz:
Graphs with chromatic number close to maximum degree. Discret. Math. 312(6): 1273-1281 (2012) - [j36]Diego Scheide, Michael Stiebitz:
The Maximum Chromatic Index of Multigraphs with Given Δ and μ. Graphs Comb. 28(5): 717-722 (2012) - 2011
- [j35]Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall:
Ohba's conjecture for graphs with independence number five. Discret. Math. 311(12): 996-1005 (2011) - 2010
- [j34]Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz:
Edge colouring by total labellings. Discret. Math. 310(2): 199-205 (2010) - [j33]Alexandr V. Kostochka, Daniel Král'
Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory B 100(6): 554-559 (2010) - [j32]Diego Scheide, Michael Stiebitz:
Vizing's coloring algorithm and the fan number. J. Graph Theory 65(2): 115-138 (2010)
2000 – 2009
- 2009
- [j31]József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz:
The Erdos-Lovász Tihany conjecture for quasi-line graphs. Discret. Math. 309(12): 3985-3991 (2009) - [j30]Diego Scheide, Michael Stiebitz:
On Vizing's bound for the chromatic index of a multigraph. Discret. Math. 309(15): 4920-4925 (2009) - [j29]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
On list critical graphs. Discret. Math. 309(15): 4931-4941 (2009) - [j28]Daniel Král
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discret. Math. 23(3): 1465-1483 (2009) - 2008
- [j27]Alexandr V. Kostochka, Michael Stiebitz:
Partitions and Edge Colourings of Multigraphs. Electron. J. Comb. 15(1) (2008) - [j26]Thomas Böhme, Tobias Gerlach
Ordered and linked chordal graphs. Discuss. Math. Graph Theory 28(2): 367-373 (2008) - [j25]Jan Hladký
List colorings with measurable sets. J. Graph Theory 59(3): 229-238 (2008) - 2006
- [j24]Michael Stiebitz, Riste Skrekovski
A map colour theorem for the union of graphs. J. Comb. Theory B 96(1): 20-37 (2006) - 2005
- [j23]V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft:
Deeply asymmetric planar graphs. J. Comb. Theory B 95(1): 68-78 (2005) - [j22]Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski
Nordhaus-Gaddum-type Theorems for decompositions into many parts. J. Graph Theory 50(4): 273-292 (2005) - 2004
- [j21]Thomas Böhme, Bojan Mohar, Riste Skrekovski
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. J. Graph Theory 45(4): 270-274 (2004) - [j20]András Gyárfás, Tommy Jensen, Michael Stiebitz:
On graphs with strongly independent color-classes. J. Graph Theory 46(1): 1-14 (2004) - 2003
- [j19]Michael D. Plummer, Michael Stiebitz, Bjarne Toft:
On a special case of Hadwiger's conjecture. Discuss. Math. Graph Theory 23(2): 333-363 (2003) - [j18]Alexandr V. Kostochka, Michael Stiebitz:
A new lower bound on the number of edges in colour-critical graphs and hypergraphs. J. Comb. Theory B 87(2): 374-402 (2003) - 2002
- [j17]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): 165-177 (2002) - 2000
- [j16]Alexandr V. Kostochka, Michael Stiebitz:
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. Comb. 20(4): 521-530 (2000)
1990 – 1999
- 1999
- [j15]Thomas Böhme, Bojan Mohar, Michael Stiebitz:
Dirac's map-color theorem for choosability. J. Graph Theory 32(4): 327-339 (1999) - 1998
- [j14]Alexandr V. Kostochka, Michael Stiebitz:
Colour-critical graphs with few edges. Discret. Math. 191(1-3): 125-137 (1998) - 1997
- [j13]Thomas Böhme, Hajo Broersma
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170(1-3): 219-222 (1997) - 1996
- [j12]Alexandr V. Kostochka, Michael Stiebitz, Brunhilde Wirth
The colour theorems of Brooks and Gallai extended. Discret. Math. 162(1-3): 299-303 (1996) - [j11]Michael Stiebitz:
Decomposing graphs under degree constraints. J. Graph Theory 23(3): 321-324 (1996) - 1995
- [j10]Michael Stiebitz, Bjarne Toft:
An Abstract Generalization of a Map Reduction Theorem of Birkhoff. J. Comb. Theory B 65(2): 165-185 (1995) - 1994
- [j9]Michael Stiebitz:
The forest plus stars colouring problem. Discret. Math. 126(1-3): 385-389 (1994) - 1992
- [j8]Herbert Fleischner, Michael Stiebitz:
A solution to a colouring problem of P. Erdös. Discret. Math. 101(1-3): 39-48 (1992) - [j7]Michael Stiebitz:
On Hadwiger's number - a problem of the Nordhaus-Gaddum type. Discret. Math. 101(1-3): 307-317 (1992) - [j6]U. Hendrich, Michael Stiebitz:
On the Bandwidth of Graph Products. J. Inf. Process. Cybern. 28(3): 113-125 (1992)
1980 – 1989
- 1989
- [j5]Horst Sachs, Michael Stiebitz:
On constructive methods in the theory of colour-critical graphs. Discret. Math. 74(1-2): 201-226 (1989) - 1988
- [j4]Horst Sachs, Michael Stiebitz, Robin J. Wilson:
An historical note: Euler's Königsberg letters. J. Graph Theory 12(1): 133-139 (1988) - 1987
- [j3]Michael Stiebitz:
Subgraphs of color-critical graphs. Comb. 7(3): 303-312 (1987) - [j2]Michael Stiebitz:
K5 is the only double-critical 5-chromatic graph. Discret. Math. 64(1): 91-93 (1987) - 1982
- [j1]Michael Stiebitz:
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. Comb. 2(3): 315-323 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: