Harant, Jochen; Richter, Sebastian; Sachs, Horst
Packing of induced subgraphs. - Chemnitz : Techn. Univ., Fak. Mathematik, 2013. - Online-Ressource (PDF-Datei: 15 S., 352 KB). - ([Preprintreihe der Fakultät Mathematik ; 2013,14])
https://edocs.tib.eu/files/e01fn14/782044271.pdf
Packing of induced subgraphs. - Chemnitz : Techn. Univ., Fak. Mathematik, 2013. - Online-Ressource (PDF-Datei: 15 S., 352 KB). - ([Preprintreihe der Fakultät Mathematik ; 2013,14])
https://edocs.tib.eu/files/e01fn14/782044271.pdf
Göring, Frank;
Harant, Jochen;
Prescribed edges and forbidden edges for a cycle in a planar graph. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 161 (2013), 12, S. 1734-1738
https://doi.org/10.1016/j.dam.2011.08.020
Prescribed edges and forbidden edges for a cycle in a planar graph. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 161 (2013), 12, S. 1734-1738
https://doi.org/10.1016/j.dam.2011.08.020
Borowiecki, Piotr; Göring, Frank; Harant, Jochen; Rautenbach, Dieter
The potential of greed for independence. - In: Journal of graph theory, ISSN 1097-0118, Bd. 71 (2012), 3/4, S. 245-259
https://doi.org/10.1002/jgt.20644
The potential of greed for independence. - In: Journal of graph theory, ISSN 1097-0118, Bd. 71 (2012), 3/4, S. 245-259
https://doi.org/10.1002/jgt.20644
Harant, Jochen; Kemnitz, Arnfried; Saito, Akira; Schiermeyer, Ingo
Closures, cycles, and paths. - In: Journal of graph theory, ISSN 1097-0118, Bd. 69 (2012), 3, S. 314-323
https://doi.org/10.1002/jgt.20584
Closures, cycles, and paths. - In: Journal of graph theory, ISSN 1097-0118, Bd. 69 (2012), 3, S. 314-323
https://doi.org/10.1002/jgt.20584
Harant, Jochen;
Nonrepetitive vertex colorings of graphs. - In: Discrete mathematics, Bd. 312 (2012), 2, S. 374-380
http://dx.doi.org/10.1016/j.disc.2011.09.027
Nonrepetitive vertex colorings of graphs. - In: Discrete mathematics, Bd. 312 (2012), 2, S. 374-380
http://dx.doi.org/10.1016/j.disc.2011.09.027
Harant, Jochen;
Jendrol', Stanislav; Madaras, Tomáš
Upper bounds on the sum of powers of the degrees of a simple planar graph. - In: Journal of graph theory, ISSN 1097-0118, Bd. 67 (2011), 2, S. 112-123
https://doi.org/10.1002/jgt.20519
Upper bounds on the sum of powers of the degrees of a simple planar graph. - In: Journal of graph theory, ISSN 1097-0118, Bd. 67 (2011), 2, S. 112-123
https://doi.org/10.1002/jgt.20519
Harant, Jochen;
A lower bound on independence in terms of degrees. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 159 (2011), 10, S. 966-970
https://doi.org/10.1016/j.dam.2011.03.003
A lower bound on independence in terms of degrees. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 159 (2011), 10, S. 966-970
https://doi.org/10.1016/j.dam.2011.03.003
Harant, Jochen;
Facial non-repetitive vertex colouring of some families of 2-connected plane graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2011. - Online-Ressource (PDF-Datei: 11 S., 177,7 KB). - (Preprint ; M11,04)
http://www.db-thueringen.de/servlets/DocumentServlet?id=17632
Facial non-repetitive vertex colouring of some families of 2-connected plane graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2011. - Online-Ressource (PDF-Datei: 11 S., 177,7 KB). - (Preprint ; M11,04)
http://www.db-thueringen.de/servlets/DocumentServlet?id=17632
Harant, Jochen;
Rautenbach, Dieter;
Independence in connected graphs. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 159 (2011), 1, S. 79-86
https://doi.org/10.1016/j.dam.2010.08.029
Independence in connected graphs. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 159 (2011), 1, S. 79-86
https://doi.org/10.1016/j.dam.2010.08.029
Artmann, Sarah;
Göring, Frank; Harant, Jochen; Rautenbach, Dieter; Schiermeyer, Ingo
Random procedures for dominating sets in graphs. - In: The electronic journal of combinatorics, ISSN 1077-8926, Volume 17 (2010), R102, Seite 1-15
https://doi.org/10.37236/374
Random procedures for dominating sets in graphs. - In: The electronic journal of combinatorics, ISSN 1077-8926, Volume 17 (2010), R102, Seite 1-15
https://doi.org/10.37236/374