Veröffentlichungen im Fachgebiet
Anzahl der Treffer: 88
Erstellt: Thu, 28 Mar 2024 23:09:08 +0100 in 0.0719 sec


Artmann, Sarah; Harant, Jochen;
Random procedures for dominating sets in bipartite graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 30 (2010), 2, S. 277-288

https://doi.org/10.7151/dmgt.1494
Boßecker, Anett; Rautenbach, Dieter
Interpolating between bounds on the independence number. - In: Discrete mathematics, Bd. 310 (2010), 17/18, S. 2398-2403

http://dx.doi.org/10.1016/j.disc.2010.05.026
Harant, Jochen;
A lower bound on independence in terms of degrees. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2010. - Online-Ressource (PDF-Datei: 6 S., 173,1 KB). - (Preprint ; M10,08)
http://www.db-thueringen.de/servlets/DocumentServlet?id=16418
Göring, Frank; Harant, Jochen;
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. - In: Discrete mathematics, 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, 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, Bd. 310 (2010), 13/14, S. 1974-1978

http://dx.doi.org/10.1016/j.disc.2010.03.009
Artmann, Sarah; Pruchnewski, Anja
Constructing a dominating set for bipartite graphs in several rounds. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 7 S., 167,9 KB). - (Preprint ; M09,37)
http://www.db-thueringen.de/servlets/DocumentServlet?id=14792
Harant, Jochen; Rautenbach, Dieter;
Independence in connected graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 10 S., 193,9 KB). - (Preprint ; M09,31)
http://www.db-thueringen.de/servlets/DocumentServlet?id=14424
Harant, Jochen; Senitsch, Stefan
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. - In: Discrete mathematics, Bd. 309 (2009), 15, S. 4949-4951

http://dx.doi.org/10.1016/j.disc.2008.04.038
Harant, Jochen; Rautenbach, Dieter; Recht, Peter; Schiermeyer, Ingo; Schulte-Loh, Eva-Maria
Packing disjoint cycles over vertex cuts. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 9 S., 166,5 KB). - (Preprint ; M09,17)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12995