Edge-integrity: a survey
β Scribed by K.S. Bagga; L.W. Beineke; M.J. Lipman; R.E. Pippert
- Book ID
- 103061168
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 584 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the problem ofefficiently breaking a graph into small components through the removal of edges. One measure of how easily this can be done is the edge-integrity, defined to be the minimum sum of the number of edges removed and the order of a largest remaining component, taken over all sets of edges. In this paper we present a survey of results concerning this parameter.
π SIMILAR VOLUMES
## Abstract This paper presents a bibliography on edgeβcolorings of graphs which is as complete as possible to date. We introduce the papers by a brief discussion of the ideas involved.