On the Genus of Strong Tensor Products of Graphs

B. L. Garman, R. D. Ringeisen, A. T. White

Source record

Source: Crossref

Published: Jun 1, 1976

DOI: 10.4153/cjm-1976-052-9

Open original source ↗

Source abstract

The genus parameter for graphs has been studied extensively in recent years, with impetus given primarily by the Ringel-Youngs solution to the Heawood Map-coloring Problem [15]. This solution involved the determination of 𝛄(K n ), the genus of the complete graph K n .

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.