Michael Stiebitz - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2023

Generalized DP-colorings of graphsAlexandr V. Kostochka, Thomas Schweser, Michael Stiebitz. DM, 346(11):113186, November 2023. [doi]

2022

Digraphs and Variable DegeneracyJørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz. siamdm, 36(1):578-595, 2022. [doi]

Point partition numbers: Decomposable and indecomposable critical graphsJustus von Postel, Thomas Schweser, Michael Stiebitz. DM, 345(8):112903, 2022. [doi]

Point Partition Numbers: Perfect GraphsJustus von Postel, Thomas Schweser, Michael Stiebitz. gc, 38(2):31, 2022. [doi]

2021

Vertex partition of hypergraphs and maximum degenerate subhypergraphsThomas Schweser, Michael Stiebitz. ejgta, 9(1):1-9, 2021. [doi]

Partitions of hypergraphs under variable degeneracy constraintsThomas Schweser, Michael Stiebitz. jgt, 96(1):7-33, 2021. [doi]

2020

Hajós and Ore Constructions for DigraphsJørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz. combinatorics, 27(1):1, 2020. [doi]

On DP-coloring of digraphsJørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz. jgt, 95(1):76-98, 2020. [doi]

The Minimum Number of Edges in 4-Critical Digraphs of Given OrderAlexandr V. Kostochka, Michael Stiebitz. gc, 36(3):703-718, 2020. [doi]

2019

Graph Edge Coloring: A SurveyYan Cao, Guantao Chen, Guangming Jing, Michael Stiebitz, Bjarne Toft. gc, 35(1):33-66, 2019. [doi]

Partitions of multigraphs under minimum degree constraintsThomas Schweser, Michael Stiebitz. DAM, 257:269-275, 2019. [doi]

2018

A Brooks Type Theorem for the Maximum Local Edge ConnectivityMichael Stiebitz, Bjarne Toft. combinatorics, 25(1):1, 2018. [doi]

2017

Horst Sachs (1927-2016)Thomas Böhme 0001, Jochen Harant, Matthias Kriesell, Michael Stiebitz. DM, 340(11):2615, 2017. [doi]

Degree choosable signed graphsThomas Schweser, Michael Stiebitz. DM, 340(5):882-891, 2017. [doi]

A Relaxed Version of the Erdős-Lovász Tihany ConjectureMichael Stiebitz. jgt, 85(1):278-287, 2017. [doi]

2015

Orientations of Graphs with Prescribed Weighted Out-DegreesMichael Stiebitz, Zsolt Tuza, Margit Voigt. gc, 31(1):265-280, 2015. [doi]

2013

Some Remarks on the Cycle Plus Triangles ProblemHerbert Fleischner, Michael Stiebitz. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 119-125, Springer, 2013. [doi]

2012

Graphs with chromatic number close to maximum degreeAlexandr V. Kostochka, Landon Rabern, Michael Stiebitz. DM, 312(6):1273-1281, 2012. [doi]

The Maximum Chromatic Index of Multigraphs with Given Δ and μDiego Scheide, Michael Stiebitz. gc, 28(5):717-722, 2012. [doi]

2011

Ohba s conjecture for graphs with independence number fiveAlexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall. DM, 311(12):996-1005, 2011. [doi]

2010

Edge colouring by total labellingsStephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz. DM, 310(2):199-205, 2010. [doi]

Graphs with bounded tree-width and large odd-girth are almost bipartiteAlexandr V. Kostochka, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz. JCT, 100(6):554-559, 2010. [doi]

Vizing s coloring algorithm and the fan numberDiego Scheide, Michael Stiebitz. jgt, 65(2):115-138, 2010. [doi]

2009

The Erdos-Lovász Tihany conjecture for quasi-line graphsJózsef Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz. DM, 309(12):3985-3991, 2009. [doi]

A New Lower Bound on the Number of Perfect Matchings in Cubic GraphsDaniel KrÃ¡l, Jean-SÃ©bastien Sereni, Michael Stiebitz. siamdm, 23(3):1465-1483, 2009. [doi]

On Vizing s bound for the chromatic index of a multigraphDiego Scheide, Michael Stiebitz. DM, 309(15):4920-4925, 2009. [doi]

On list critical graphsMichael Stiebitz, Zsolt Tuza, Margit Voigt. DM, 309(15):4931-4941, 2009. [doi]

2008

Ordered and linked chordal graphsThomas Böhme, Tobias Gerlach, Michael Stiebitz. dmgt, 28(2):367-373, 2008. [doi]

List colorings with measurable setsJan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz. jgt, 59(3):229-238, 2008. [doi]

Partitions and Edge Colourings of MultigraphsAlexandr V. Kostochka, Michael Stiebitz. combinatorics, 15(1), 2008. [doi]

2006

A map colour theorem for the union of graphsMichael Stiebitz, Riste Skrekovski. JCT, 96(1):20-37, 2006. [doi]

2005

Deeply asymmetric planar graphsV. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft. JCT, 95(1):68-78, 2005. [doi]

Nordhaus-Gaddum-type Theorems for decompositions into many partsZoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West. jgt, 50(4):273-292, 2005. [doi]

2004

Subdivisions of large complete bipartite graphs and long induced paths in ::::k::::-connected graphsThomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz. jgt, 45(4):270-274, 2004. [doi]

On graphs with strongly independent color-classesAndrás Gyárfás, T. Jensen, Michael Stiebitz. jgt, 46(1):1-14, 2004. [doi]

2003

A new lower bound on the number of edges in colour-critical graphs and hypergraphsAlexandr V. Kostochka, Michael Stiebitz. JCT, 87(2):374-402, 2003. [doi]

On a special case of Hadwiger's conjectureMichael D. Plummer, Michael Stiebitz, Bjarne Toft. dmgt, 23(2):333-363, 2003. [doi]

2002

A list version of Dirac's theorem on the number of edges in colour-critical graphsAlexandr V. Kostochka, Michael Stiebitz. jgt, 39(3):165-177, 2002. [doi]

2000

On the Number of Edges in Colour-Critical Graphs and HypergraphsAlexandr V. Kostochka, Michael Stiebitz. combinatorica, 20(4):521-530, 2000. [doi]

1999

Dirac's map-color theorem for choosabilityThomas Böhme, Bojan Mohar, Michael Stiebitz. jgt, 32(4):327-339, 1999. [doi]

1998

Colour-critical graphs with few edgesAlexandr V. Kostochka, Michael Stiebitz. DM, 191(1-3):125-137, 1998. [doi]

1997

Spanning trees with pairwise nonadjacent endverticesThomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz. DM, 170(1-3):219-222, 1997. [doi]

1996

The colour theorems of Brooks and Gallai extendedAlexandr V. Kostochka, Michael Stiebitz, B. Wirth. DM, 162(1-3):299-303, 1996. [doi]

Decomposing graphs under degree constraintsMichael Stiebitz. jgt, 23(3):321-324, 1996. [doi]

1995

An Abstract Generalization of a Map Reduction Theorem of BirkhoffMichael Stiebitz, Bjarne Toft. JCT, 65(2):165-185, 1995. [doi]

1994

The forest plus stars colouring problemMichael Stiebitz. DM, 126(1-3):385-389, 1994. [doi]

1992

A solution to a colouring problem of P. ErdösHerbert Fleischner, Michael Stiebitz. DM, 101(1-3):39-48, 1992. [doi]

On the Bandwidth of Graph ProductsU. Hendrich, Michael Stiebitz. eik, 28(3):113-125, 1992.

On Hadwiger s number - a problem of the Nordhaus-Gaddum typeMichael Stiebitz. DM, 101(1-3):307-317, 1992. [doi]

1988

An historical note: Euler's Königsberg lettersHorst Sachs, Michael Stiebitz, Robin J. Wilson. jgt, 12(1):133-139, 1988. [doi]

1987

Subgraphs of color-critical graphsMichael Stiebitz. combinatorica, 7(3):303-312, 1987.

K::5:: is the only double-critical 5-chromatic graphMichael Stiebitz. DM, 64(1):91-93, 1987. [doi]

1982

Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphsMichael Stiebitz. combinatorica, 2(3):315-323, 1982.

Sign in or sign up to see more results.

runs on WebDSL