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

Removing edge-node intersections in drawings of graphs

โœ Scribed by Wei Lai; Peter Eades

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
130 KB
Volume
81
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Removable edges in 3-connected graphs
Removable edges in 3-connected graphs
โœ Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 404 KB

## Abstract An edge __e__ of a 3โ€connected graph __G__ is said to be __removable__ if __G__ โ€ __e__ is a subdivision of a 3โ€connected graph. If __e__ is not removable, then __e__ is said to be __nonremovable.__ In this paper, we study the distribution of removable edges in 3โ€connected graphs and pr

T-joins intersecting small edge-cuts in
T-joins intersecting small edge-cuts in graphs
โœ Tomรกลก Kaiser; Riste ล krekovski ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB

## Abstract In an earlier paper 3, we studied cycles in graphs that intersect all edgeโ€cuts of prescribed sizes. Passing to a more general setting, we examine the existence of __T__โ€joins in grafts that intersect all edgeโ€cuts whose size is in a given set __A__ โŠ†{1,2,3}. In particular, we character

The Number of Removable Edges in 3-Conne
The Number of Removable Edges in 3-Connected Graphs
โœ Su Jianji ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 147 KB

An edge of a 3-connected graph G is said to be removable if G&e is a subdivision of a 3-connected graph. Holton et al. (1990) proved that every 3-connected graph of order at least five has at least W(|G| +10)ร‚6X removable edges. In this paper, we prove that every 3-connected graph of order at least