Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-28T09:20:49.364Z Has data issue: false hasContentIssue false
  • English
  • Français

Graphs Suppressible to an Edge

Published online by Cambridge University Press:  20 November 2018

F. Harary ,
J. Krarup  and
A. Schwenk
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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 15 , Issue 2 , June 1972 , pp. 201 - 204
Copyright
Copyright © Canadian Mathematical Society 1972

References

1. Dirac, G. A., In abstrakten Graphen vorhandene vollst?ndige 4-Graphen und ihre Unterteilungen, Math. Nachr. 22 (1960), 61-85.Google Scholar
2. Harary, F. and Krarup, J., On outerplanar graphs and a class of discrete optimization programs (unpublished manuscript).Google Scholar
3. Harary, F., Graph theory, Addison-Wesley, Reading, Mass., 1969.Google Scholar
4. Harary, F., Norman, R., and Cartwright, D., Structural models: an introduction to the theory of directed graphs, Wiley, New York, 1965.Google Scholar