𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Special subgraphs of weighted visibility graphs

✍ Scribed by F.R. Hsu; R.C.T. Lee; R.C. Chang

Book ID
107766002
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
510 KB
Volume
43
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite subgraphs of integer weighted
Bipartite subgraphs of integer weighted graphs
✍ Noga Alon; Eran Halperin πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 411 KB

For every integer p > 0, let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f((~)+m)= LΒΌn2j +min (IΒ½nT,f(m)). This supplies the precise value of f(p) for many values of p includin

Subgraphs of graphs, I
Subgraphs of graphs, I
✍ Paul A. Catlin πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 737 KB

&et G' and H aphs on p vertices. We give a suffictent Londition, based f the verrices of G and the maximum degree of t w vertices of ff' for Throughout this paper, all graphs considered are finite and simpl;. The C&~WP of a vertex v in the graph G is denoted deg<; (v). The vertex set of G is dencted