423 citations · 689 across the 30 of their papers we have counts for
4 papers · 1 filter
An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs
V. Ejov, N. Pugacheva, S. Rossomakhine +1
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that sepa…
Clustering of spectra and fractals of regular graphs
V. Ejov, J. A. Filar, S. K. Lucas +1
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike…
The first Chern form on moduli of parabolic bundles
Leon A. Takhtajan, Peter G. Zograf
For moduli space of stable parabolic bundles on a compact Riemann surface, we derive an explicit formula for the curvature of its canonical line bundle with respect to Quillen's me…
Tensor networks and the enumeration of regular subgraphs
Peter Zograf
We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph al…