|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall |
Ohba's conjecture for graphs with independence number five.  |
Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz |
Graphs with bounded tree-width and large odd-girth are almost bipartite. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz |
Edge colouring by total labellings. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Scheide, Michael Stiebitz |
Vizing's coloring algorithm and the fan number. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Scheide, Michael Stiebitz |
On Vizing's bound for the chromatic index of a multigraph. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz |
The Erdos-Lovász Tihany conjecture for quasi-line graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz, Zsolt Tuza, Margit Voigt |
On list critical graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz |
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Michael Stiebitz |
Partitions and Edge Colourings of Multigraphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Thomas Böhme, Tobias Gerlach, Michael Stiebitz |
Ordered and linked chordal graphs. |
Discussiones Mathematicae Graph Theory |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz |
List colorings with measurable sets. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz, Riste Skrekovski |
A map colour theorem for the union of graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft |
Deeply asymmetric planar graphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West |
Nordhaus-Gaddum-type Theorems for decompositions into many parts. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz |
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, T. Jensen, Michael Stiebitz |
On graphs with strongly independent color-classes. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Michael Stiebitz |
A new lower bound on the number of edges in colour-critical graphs and hypergraphs. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Michael Stiebitz |
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C15 |
| 1 | Alexandr V. Kostochka, Michael Stiebitz |
Colour-critical graphs with few edges. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz |
Spanning trees with pairwise nonadjacent endvertices. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Michael Stiebitz, B. Wirth |
The colour theorems of Brooks and Gallai extended. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz, Bjarne Toft |
An Abstract Generalization of a Map Reduction Theorem of Birkhoff. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Michael Stiebitz |
A solution to a colouring problem of P. Erdös. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz |
On Hadwiger's number - a problem of the Nordhaus-Gaddum type. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | U. Hendrich, Michael Stiebitz |
On the Bandwidth of Graph Products. |
Elektronische Informationsverarbeitung und Kybernetik |
1992 |
DBLP BibTeX RDF |
|
| 1 | Horst Sachs, Michael Stiebitz |
On constructive methods in the theory of colour-critical graphs. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz |
K5 is the only double-critical 5-chromatic graph. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz |
Subgraphs of color-critical graphs. |
Combinatorica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Stiebitz |
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. |
Combinatorica |
1982 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")