Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T07:11:22.739Z Has data issue: false hasContentIssue false

Graphs Suppressible to an Edge

Published online by Cambridge University Press:  20 November 2018

F. Harary
Affiliation:
University of Waterloo, Waterloo, Ontario
J. Krarup
Affiliation:
University of Waterloo, Waterloo, Ontario
A. Schwenk
Affiliation:
Technical University of Denmark, Charlottenlund, Denmark
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An application of graph theory to automatic traffic control [2] gave rise to the problem of deciding which connected graphs have points of degree 2 which can be successively suppressed until only a single edge remains.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1972