http://www.tu-ilmenau.de

Logo TU Ilmenau


Arbeitsgruppe
Diskrete Mathematik und Algebra


Foto des Ansprechpartners
Ansprechpartner

Univ.-Prof. Dr. rer. nat. habil. Matthias Kriesell

Fachgebietsleiter

Telefon +49 3677 69-3633

E-Mail senden


Ihre Position

INHALTE

Publikationsliste seit 1990

Anzahl der Treffer: 364
Erstellt: Wed, 13 Dec 2017 23:04:26 +0100 in 0.1776 sec


Göring, Frank; Harant, Jochen
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 310 (2010), 9, S. 1491-1494
http://dx.doi.org/10.1016/j.disc.2009.10.005
Harant, Jochen; Rautenbach, Dieter; Recht, Peter; Regen, Friedrich
Packing edge-disjoint cycles in graphs and the cyclomatic number. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 310 (2010), 9, S. 1456-1462
http://dx.doi.org/10.1016/j.disc.2009.07.017
Harant, Jochen; Rautenbach, Dieter; Recht, Peter; Schiermeyer, Ingo; Sprengel, Eva-Maria
Packing disjoint cycles over vertex cuts. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 310 (2010), 13/14, S. 1974-1978
http://dx.doi.org/10.1016/j.disc.2010.03.009
Draque Penso, Lucia; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz
Cycles, paths, connectivity and diameter in distance graphs. - In: Graph theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24 - 26, 2009 ; revised papers. - Berlin [u.a.] : Springer / WG ; 35 (Montpellier) : 2009.06.24-26., ISBN 978-3-642-11409-0, (2010), S. 320-328

http://dx.doi.org/10.1007/978-3-642-11409-0
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L.
Some remarks on the geodetic number of a graph. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 310 (2010), 4, S. 832-837
http://dx.doi.org/10.1016/j.disc.2009.09.018
Scheide, Diego
Graph edge colouring: Tashkinov trees and Goldberg's conjecture. - In: Journal of combinatorial theory / B. - Orlando, Fla : Academic Press, Bd. 100 (2010), 1, S. 68-96
http://dx.doi.org/10.1016/j.jctb.2009.04.001
Brandt, Stephan; Budajová, Kristína; Rautenbach, Dieter; Stiebitz, Michael
Edge colouring by total labellings. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 310 (2010), 2, S. 199-205
http://dx.doi.org/10.1016/j.disc.2008.09.013
Brandt, Stephan
Triangle-free graphs whose independence number equals the degree. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 310 (2010), 3, S. 662-669
http://dx.doi.org/10.1016/j.disc.2009.05.021
Henning, Michael A.; Löwenstein, Christian; Rautenbach, Dieter
An independent dominating set in the complement of a minimum dominating set of a tree. - In: Applied mathematics letters. - Amsterdam [u.a.] : Elsevier Sci, Bd. 23 (2010), 1, S. 79-81
http://dx.doi.org/10.1016/j.aml.2009.08.008
Král', Daniel; Sereni, Jean-Sébastien; Stiebitz, Michael
A new lower bound on the number of perfect matchings in cubic graphs. - In: SIAM journal on discrete mathematics. - Philadelphia, Pa : Soc, ISSN 10957146, Bd. 23 (2009), 3, S. 1465-1483
http://dx.doi.org/10.1137/080723843