Graphs Suppressible to an Edge
Canadian mathematical bulletin, Tome 15 (1972) no. 2, pp. 201-204
Voir la notice de l'article provenant de la source Cambridge University Press
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.
Harary, F.; Krarup, J.; Schwenk, A. Graphs Suppressible to an Edge. Canadian mathematical bulletin, Tome 15 (1972) no. 2, pp. 201-204. doi: 10.4153/CMB-1972-036-5
@article{10_4153_CMB_1972_036_5,
author = {Harary, F. and Krarup, J. and Schwenk, A.},
title = {Graphs {Suppressible} to an {Edge}},
journal = {Canadian mathematical bulletin},
pages = {201--204},
year = {1972},
volume = {15},
number = {2},
doi = {10.4153/CMB-1972-036-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-036-5/}
}
[1] 1. Dirac, G. A., In abstrakten Graphen vorhandene vollst?ndige 4-Graphen und ihre Unterteilungen, Math. Nachr. 22 (1960), 61-85. Google Scholar
[2] 2. Harary, F. and Krarup, J., On outerplanar graphs and a class of discrete optimization programs (unpublished manuscript). Google Scholar
[3] 3. Harary, F., Graph theory, Addison-Wesley, Reading, Mass., 1969. Google Scholar
[4] 4. Harary, F., Norman, R., and Cartwright, D., Structural models: an introduction to the theory of directed graphs, Wiley, New York, 1965. Google Scholar
Cité par Sources :