4 citations · 5 across the 4 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
math.CO2006
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…
math.CO2006
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…
math.CO2006★ 4 cited
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…