Cyclic operads and homology of graph complexes
Markl, Martin
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Recognizing circulant graphs of prime order in polynomial time.”
Cyclic operads and homology of graph complexes
Some cyclic solutions to the three table Oberwolfach problem.
Ollis, M.A. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A generalization of generalized Paley graphs and new lower bounds for .
Wu, Kang, Su, Wenlong, Luo, Haipeng, Xu, Xiaodong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Separability number and Schurity number of coherent configurations.
Evdokimov, Sergei, Ponomarenko, Ilia (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Atoms of cyclic connectivity in cubic graphs
Roman Nedela, Martin Škoviera (1995)
Mathematica Slovaca
Similarity: