𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tight lower bound on the size of visibility graphs

✍ Scribed by Xiaojun Shen; Herbert Edelsbrunner

Book ID
113162992
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
451 KB
Volume
26
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tight lower bound on the maximum genus
A tight lower bound on the maximum genus of a simplicial graph
✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

Bounds on the lower size of A 7-critical
Bounds on the lower size of A 7-critical graph
✍ Huanping Liu; Zhongfu Zhang; Dean Shen πŸ“‚ Article πŸ“… 1994 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 307 KB
On the minimum size of visibility graphs
On the minimum size of visibility graphs
✍ Alfredo GarcΔ±́a Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 177 KB

In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the barvisibility graph of n disjoint line segments in the plane, according to their vertex-connectivity.