𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sequential connectivity of 3-complexes

✍ Scribed by Jonathan Simon

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
668 KB
Volume
24
Category
Article
ISSN
0166-8641

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connected sequential colorings
Connected sequential colorings
✍ A. Hertz; D. de Werra πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 824 KB

Let us consider a graph G = (V, E). A k-coloring (S,, . . . , Sk) of its nodes is called canonical if any node u E V of any color i is contained in a clique K of size i such that K n S' # ff for 1 CjGi. A connected order on a connected graph G = (V, E) is any order u1 < a --c up such that {u l,"',

Hamiltonian connectivity and globally 3βˆ—
Hamiltonian connectivity and globally 3βˆ—-connectivity of dual-cube extensive networks
✍ Shih-Yan Chen; Shin-Shin Kao πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 784 KB

In 2000, Li et al. introduced dual-cube networks, denoted by DC n for n P 1, using the hypercube family Q n and showed the vertex symmetry and some fault-tolerant hamiltonian properties of DC n . In this article, we introduce a new family of interconnection networks called dual-cube extensive networ

Foundations of a Connectivity Theory for
Foundations of a Connectivity Theory for Simplicial Complexes
✍ HΓ©lΓ¨ne Barcelo; Xenia Kramer; Reinhard Laubenbacher; Christopher Weaver πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 422 KB

This paper lays the foundations of a combinatorial homotopy theory, called A-theory, for simplicial complexes, which reflects their connectivity properties. A collection of bigraded groups is constructed, and methods for computation are given. A Seifert-Van Kampen type theorem and a long exact seque