𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Assessing polygon edge integrity
✍ Steven A. Roberts; G. Brent Hall; Paul H. Calamai πŸ“‚ Article πŸ“… 2001 πŸ› Springer-Verlag 🌐 English βš– 856 KB
A bibliographic survey of edge-colorings
✍ S. Fiorini πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 680 KB

## 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.

INTEGRAL surveys
✍ R. Walter; G. Bourban; K. Ebisawa; P. Kretschmar; A. Paizis πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 67 KB
A Survey on the Inverse Integrating Fact
✍ Isaac A. GarcΓ­a; Maite Grau πŸ“‚ Article πŸ“… 2010 πŸ› SP BirkhΓ€user Verlag Basel 🌐 English βš– 596 KB