Graphs Suppressible to an Edge
- 1 June 1972
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 15 (2) , 201-204
- https://doi.org/10.4153/cmb-1972-036-5
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre UnterteilungenMathematische Nachrichten, 1960