A note on divisibility of the number of matchings of a family of graphs.
Hwang, Kyung-Won, Sheikh, Naeem N., Hartke, Stephen G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3.”
A note on divisibility of the number of matchings of a family of graphs.
Divisibility by 3 of even multiperfect numbers of abundancy 3 and 4.
Broughan, Kevin A., Zhou, Qizhi (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Enumeration of perfect matchings of a type of quadratic lattice on the torus.
Lu, Fuliang, Zhang, Lianzhu, Lin, Fenggen (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The cycles of the multiway perfect shuffle permutation.
Ellis, John, Fan, Hongbing, Shallit, Jeffrey (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Sylvester: ushering in the modern era of research on odd perfect numbers.
Gimbel, Steven, Jaroma, John H. (2003)
Integers
Similarity:
Perfect Gaussian integers
Wayne McDaniel (1974)
Acta Arithmetica
Similarity:
Perfect arithmetic codes
H. W., Jr. Lenstra (1977-1978)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
The cyclic sieving phenomenon for faces of cyclic polytopes.
Eu, Sen-Peng, Fu, Tung-Shan, Pan, Yeh-Jong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounds on the Turán density of PG(3, 2).
Cioabă, Sebastian M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Note on perfect and multiply perfect numbers
McCarthy, Paul J. (1957)
Portugaliae mathematica
Similarity:
Perfect dominating sets in the Cartesian products of prime cycles.
Hatami, Hamed, Hatami, Pooya (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Odd perfect numbers of a special form
Tomohiro Yamada (2005)
Colloquium Mathematicae
Similarity:
We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.