Elementary elliptic (R,q)-polycycles
Michel Deza, Mathieu Dutour, Mikhail Shtogrin
Abstract
We consider the following generalization of the decomposition theorem for polycycles. A (R,q)-polycycle is, roughly, a plane graph, whose faces, besides some disjoint holes, are i-gons, i ∈ R, and whose vertices, outside of holes, are q-valent. Such polycycle is called elliptic, parabolic or hyperbolic if 1q + 1r - 1/2 (where r=maxi ∈ Ri) is positive, zero or negative, respectively. An edge on the boundary of a hole in such polycycle is called open if both its end-vertices have degree less than q. We enumerate all elliptic elementary polycycles, i.e. those that any elliptic (R,q)-polycycle can be obtained from them by agglomeration along some open edges.
Create a lesson
Related papers
2-large sets are sets of nil-Bohr recurrence
Ryan Alweiss, Sohail Farhangi
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
Edge and spectral conditions for rainbow bipancyclicity in bipartite graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
The rich-neighbor chromatic index is linear in the maximum degree
Masaki Kashima, Mirko Petruševski, Jelena Sedlar et al.
The (km,kn)-square paths theorem
Dun Qiu, Minhao Zhang
Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph
Joseph Natal, Oleksiy Al-saadi