๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Distances and cuts in planar graphs

โœ Scribed by A Schrijver

Book ID
107884278
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
570 KB
Volume
46
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Many Distances in Planar Graphs
Many Distances in Planar Graphs
โœ Sergio Cabello ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer ๐ŸŒ English โš– 676 KB
Geodesic distance in planar graphs
Geodesic distance in planar graphs
โœ J. Bouttier; P. Di Francesco; E. Guitter ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB
Packings of cuts realizing distances bet
Packings of cuts realizing distances between certain vertices in a planar graph
โœ A.V. Karzanov ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 958 KB

Recently A. Schrijver proved the following theorem. Suppose that G = (V, E) is a connected planar graph embedded in the euclidean plane, that 0 and Z are two of its faces, and that the edges e E E have nonnegative integer-valued lengths Z(e) such that the length of each circuit in G is even. Then th