The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A028446

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A028446

Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}.
(history; published version)

#7 by Alois P. Heinz at Mon Dec 09 18:32:57 EST 2013

STATUS

editing

#6 by Alois P. Heinz at Mon Dec 09 18:32:53 EST 2013

DATA

9, 5051532105

OFFSET

1,1

STATUS

approved

#5 by Russ Cox at Sat Mar 31 14:40:22 EDT 2012

AUTHOR

Per Hakan Lundow (phl(AT)theophys.kth.se)

Discussion

Sat Mar 31

14:40

OEIS Server: https://oeis.org/edit/global/947

#4 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

LINKS

Per Hakan Lundow, <a href="http://www.math.umu.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.

KEYWORD

nonn,bref,more,new

#3 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007

REFERENCES

P.H. Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.

LINKS

P.-H. Lundow, <a href="http://www.math.umu.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.

KEYWORD

nonn,bref,more,new

AUTHOR

Per-Hakan Lundow (phl(AT)theophys.kth.se)

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n} .

LINKS

<a href="http://www.math.umu.se/Combinatorics/CombHome.html">For more info</a>

KEYWORD

nonn,bref,more,new

AUTHOR

Per-Hakan Lundow (per-hakan.lundow@math.umu.se)

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999

NAME

DATA

OFFSET

REFERENCES

LINKS

KEYWORD

AUTHOR

STATUS