𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comment on "Graph-theoretic proof of a network theorem and some consequences"

✍ Scribed by Bose, N.K.; Thulasiraman, K.; Swamy, M.N.S.; Jayakumar, R.

Book ID
119814457
Publisher
IEEE
Year
1985
Tongue
English
Weight
118 KB
Volume
73
Category
Article
ISSN
0018-9219

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterisation of some 2-connected g
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
✍ Victor Bryant πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 196 KB

A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem. usually dealt with in two cases. is in fact covered by one of the cases. ## 1. Some 2-connected graphs Throughout this paper G = (V, E)