CI index in tubular nanostructures. - In: Match, ISSN 0340-6253, Bd. 57 (2007), 2, S. 479-484
Spectra of toroidal graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 44 S. = 811 KB. - (Preprint ; M07,04)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9350
Edge colouring by total labellings. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 13 S. = 181,5 KB, Text. - (Preprint ; M07,03)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9347
Vertex-oblique graphs. - In: Discrete mathematics, Bd. 307 (2007), 11/12, S. 1538-1544
Let x be a vertex of a simple graph G. The vertex-type of x is the lexicographically ordered degree sequence of its neighbors. We call the graph G vertex-oblique if there are no two vertices in V(G) which are of the same vertex-type. We will show that the set of vertex-oblique graphs of arbitrary connectivity is infinite.
http://dx.doi.org/10.1016/j.disc.2005.11.091
Generalized operations on maps. - In: Croatica chemica acta, ISSN 0011-1643, Bd. 79 (2006), 3, S. 355-362
Omega polynomial in tubular nanostructures. - In: Croatica chemica acta, ISSN 0011-1643, Bd. 79 (2006), 3, S. 445-448
Global connectivity and expansion: long cycles and factors in f-connected graphs. - In: Combinatorica, ISSN 1439-6912, Bd. 26 (2006), 1, S. 17-36
http://dx.doi.org/10.1007/s00493-006-0002-5
Čislo kosych poli&ptbov;edralьnych grafov s malym čislom veršin. - In: Problemy intellektualizacii i kačestva sistem informatiki, (2006), S. 34-41
The paper considers polyhedral graphs (graphs of polyhedron or planar 3-connected graphs). A face $\alpha$ of size $k$ of a polyhedral graph is of type $<a_1,a_2,...,a_k>$ if the vertices incident with $\alpha$ in cyclic order have degrees $a_1,a_2,...,a_k$ and this sequence is lexicographically minimal. A polyhedral graph is oblique if it has no two faces of the same type. The number of polyhedral graphs with up to 12 vertices is found. Some additional properties of such graphs are also considered.
List colourings of planar graphs. - In: Discrete mathematics, Bd. 306 (2006), 10/11, S. 1076-1079
http://dx.doi.org/10.1016/j.disc.2006.03.027
Linkability in iterated line graphs. - In: Discrete mathematics, Bd. 306 (2006), 7, S. 666-669
http://dx.doi.org/10.1016/j.disc.2005.11.018