Solution to problem 10278 [1993, 76] - Enumerating admissible graphs on a 3-torus

A.N. Woord, 't

Research output: Contribution to journalArticleProfessional

Abstract

No abstract.
Original languageEnglish
Pages (from-to)810-811
Number of pages2
JournalAmerican Mathematical Monthly
Volume103
Issue number9
Publication statusPublished - 1996

Fingerprint

Torus
Graph in graph theory

Cite this

@article{1916cdeb4a7243c7bb464c6c77138ec8,
title = "Solution to problem 10278 [1993, 76] - Enumerating admissible graphs on a 3-torus",
abstract = "No abstract.",
author = "{Woord, 't}, A.N.",
year = "1996",
language = "English",
volume = "103",
pages = "810--811",
journal = "American Mathematical Monthly",
issn = "0002-9890",
publisher = "Mathematical Association of America",
number = "9",

}

Solution to problem 10278 [1993, 76] - Enumerating admissible graphs on a 3-torus. / Woord, 't, A.N.

In: American Mathematical Monthly, Vol. 103, No. 9, 1996, p. 810-811.

Research output: Contribution to journalArticleProfessional

TY - JOUR

T1 - Solution to problem 10278 [1993, 76] - Enumerating admissible graphs on a 3-torus

AU - Woord, 't, A.N.

PY - 1996

Y1 - 1996

N2 - No abstract.

AB - No abstract.

M3 - Article

VL - 103

SP - 810

EP - 811

JO - American Mathematical Monthly

JF - American Mathematical Monthly

SN - 0002-9890

IS - 9

ER -