A new proof of a theorem of Graham and Pollak
type: Item
instance of: scholarly article
title: A new proof of a theorem of Graham and Pollak
zbMATH Open document ID: 0533.05049
DOI: 10.1016/0012-365X(84)90174-2
author: G. W. Peck
published in: Discrete Mathematics
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3845627
zbMATH Keywords: complete bipartite graphs
zbMATH Keywords: complete graph
zbMATH Keywords: decomposition
MaRDI profile type: Publication
cites work: On the Addressing Problem for Loop Switching
cites work: On the decomposition ofkn into complete bipartite graphs
full work available at URL: 0012-365x(84)90174-2
OpenAlex ID: W1964610196
Recommended article: A new proof of the Gerritzen-Grauert theorem
Recommended article: A simple proof of Graham and Pollak's theorem
Recommended article: A new proof of Poltoratskii's theorem
Recommended article: Another simple proof of Graham and Pollak's theorem
Recommended article: A polynomial space proof of the Graham-Pollak theorem
Recommended article: A new proof of Gumm's theorem
Recommended article: A counting proof of the Graham-Pollak theorem
Recommended article: A new proof of the GGR conjecture
Recommended article: Q4721148
Recommended article: A generalization of Graham's conjecture
description: scientific article; zbMATH DE number 3845627