𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3D line voxelization and connectivity control

✍ Scribed by Cohen-Or, D.; Kaufman, A.

Book ID
117877677
Publisher
IEEE
Year
1997
Tongue
English
Weight
212 KB
Volume
17
Category
Article
ISSN
0272-1716

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with prescribed connectivity and
Graphs with prescribed connectivity and line graph connectivity
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## Abstract Chartrand and Stewart have shown that the line graph of an __n__‐connected graph is itself __n__‐connected. This paper shows that for every pair of integers __m__ > __n__ > 1 there is a graph of point connectivity __n__ whose line graph has point connectivity __m__. The corresponding qu

On-line connectivity algorithms
On-line connectivity algorithms
✍ Grant A. Cheston πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 615 KB
On hamiltonian line graphs and connectiv
On hamiltonian line graphs and connectivity
✍ Siming Zhan πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 444 KB

A well-known conjecture of Thomassen says that every 4-connected line graph is hamiltonian. In this paper we prove that every 7-connected line graph is hamiltonian-connected. For line graph, C. Thomassen [l] made the following conjecture. Conjecture. Every 4-connected line graph is hamiltonian.