The absence of efficient dual pairs of spanning trees in planar graphs.
The genera, reflexibility and simplicity of regular maps
This paper uses combinatorial group theory to help answer some long-standing questions about the genera of orientable surfaces that carry particular kinds of regular maps. By classifying all orientably-regular maps whose automorphism group has order coprime to , where is the genus, all orientably-regular maps of genus for prime are determined. As a consequence, it is shown that orientable surfaces of infinitely many genera carry no regular map that is chiral (irreflexible), and that orientable...
The neighborhood complex of an infinite graph.
The reflexible hypermaps of characteristic
Thin presentation of knots and lens spaces.
Toward optimality in discrete Morse theory.
Universal coverings of PL-mainfolds via coloured graphs.
What is a virtual link?
Yamada polynomial and crossing number of spatial graphs.
In this paper we estimate the crossing number of a flat vertex graph in 3-space in terms of the reduced degree of its Yamada polynomial.
Zeros of the Jones polynomial are dense in the complex plane.
Диаграммы Хегора и крашеные многогранники
Об инвариантах Кауффмана для 6-валентных графов