Publications of the Group
Anzahl der Treffer: 88
Erstellt: Mon, 06 Dec 2021 23:13:32 +0100 in 0.0516 sec


Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.;
Circumference of essentially 4-connected planar triangulations. - In: Journal of graph algorithms and applications, ISSN 1526-1719, Bd. 25 (2021), 1, S. 121-132
Sonstige Körperschaft: Technische Universität Hamburg

http://nbn-resolving.de/urn:nbn:de:gbv:830-882.0120423
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.;
On the circumference of essentially 4-connected planar graphs. - In: Journal of graph algorithms and applications, ISSN 1526-1719, Bd. 24 (2020), 1, S. 21-46

http://dx.doi.org/10.7155/jgaa.00516
Fabrici, Igor; Harant, Jochen; Madaras, Tomáš; Mohr, Samuel; Soták, Roman; Zamfirescu, Carol T.;
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 95 (2020), 1, S. 125-137

https://doi.org/10.1002/jgt.22542
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.;
Longer cycles in essentially 4-connected planar graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 40 (2020), 1, S. 269-277

https://doi.org/10.7151/dmgt.2133
Mohr, Samuel;
Cycles through a set of specified vertices of a planar graph. - In: Acta mathematica Universitatis Comenianae, ISSN 0862-9544, Bd. 88 (2019), 3, S. 963-966

Harant, Jochen; Jendrol', Stanislav;
Lightweight paths in graphs. - In: Opuscula mathematica, ISSN 2300-6919, Bd. 39 (2019), 6, S. 829-837

https://doi.org/10.7494/OpMath.2019.39.6.829
Harant, Jochen; Mohr, Samuel;
On Selkow's bound on the independence number of graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 39 (2019), 3, S. 655-657

https://doi.org/10.7151/dmgt.2100
Harant, Jochen; Fabrici, Igor; Jendrol', Stanislav;
On longest cycles in essentially 4-connected planar graphs. - In: Electronic notes in discrete mathematics, ISSN 1571-0653, Bd. 55 (2016), S. 143-146

https://doi.org/10.1016/j.endm.2016.10.036
Harant, Jochen; Kemnitz, Arnfried;
Lower bounds on the sum choice number of a graph. - In: Electronic notes in discrete mathematics, ISSN 1571-0653, Bd. 53 (2016), S. 421-431

http://dx.doi.org/10.1016/j.endm.2016.05.036
Fabrici, Igor; Harant, Jochen; Jendrol', Stanislav;
On longest cycles in essentially 4-connected planar graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 36 (2016), 3, S. 565-575

http://dx.doi.org/10.7151/dmgt.1875