𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the cuts and cut number of the 4-cube

✍ Scribed by M.R Emamy-Khansary

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
348 KB
Volume
41
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Number of Plane Corner Cuts
The Number of Plane Corner Cuts
✍ Sylvie Corteel; GaΓ«l RΓ©mond; Gilles Schaeffer; Hugh Thomas πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 61 KB

In this article we give a generating function for the number # 2 n cut of plane corner cuts with respect to their size and prove that there exist two positive constants c and c such that, for all n > 1, We rely on [Onn-Sturmfels] for motivations for this work and we simply recall the following defi

On the number of small cuts in a graph
On the number of small cuts in a graph
✍ Monika Henzinger; David P. Williamson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 356 KB
On the integral 4-packing of T-cuts
On the integral 4-packing of T-cuts
✍ Frieda Granot; Michal Penn πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 777 KB

Let C = (V, E) be an undirected graph, w : E + Z' a weight function and T c V an even subset of vertices from G. A T-cut is an edge-cut set which divides T into two odd sets. For ( Tj = 4 Seymour gave a good characterization of the graphs for which there exists a maximum packing of T-cuts that is in

On the chromatic number of cube-like gra
On the chromatic number of cube-like graphs
✍ Charles Payan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 343 KB

A cube-like graph is a graph whose vertices are all 2" subsets of a set E of cardinality n, in which two vertices are adjacent if their symmetric difference is a member of a given specified collection of subsets of E. Many authors were interested in the chromatic number of such graphs and thought it