𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification of certain subgraphs of the 3-dimensional grid

✍ Scribed by Jan Kristian Haugland

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
190 KB
Volume
42
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We prove by β€œtrial‐ and‐error” that up to isometry, there are exactly four different non‐empty cubic induced subgraphs of the 3‐dimensional grid with girth β‰₯ 10. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 42: 34–60, 2003

πŸ“œ SIMILAR VOLUMES

On the chromaticity of certain subgraphs
On the chromaticity of certain subgraphs of a q-tree
✍ Thomas Wanner πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 389 KB

We show that a graph G on n I 9 + 1 vertices (where 9 z 2) has the chromatic polynomial P(G; A) = A(A -1) ... (Aq + 2) (A -9 + 1)' (Aq)n-4-1 if and only if G can be obtained from a q-tree Ton n vertices by deleting an edge contained in exactly q -1 triangles of T: Furthermore, we prove that these gr

Dilation-5 Embedding of 3-Dimensional Gr
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes
✍ M.Y. Chan; F. Chin; C.N. Chu; W.K. Mak πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 271 KB

We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercube on a one-to-one basis with dilation at most 5.

The 2-dimensional rigidity of certain fa
The 2-dimensional rigidity of certain families of graphs
✍ Bill Jackson; Brigitte Servatius; Herman Servatius πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

## Abstract Laman's characterization of minimally rigid 2‐dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and exploited by L. LovΓ‘sz and Y. Yemini. Global rigidity has only recently been characterized by a combination of two

Algorithm for finding one of the largest
Algorithm for finding one of the largest common subgraphs of two three-dimensional graph structures
✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr

ON THE ANALYSIS OF CERTAIN HIGH DIMENSIO
ON THE ANALYSIS OF CERTAIN HIGH DIMENSIONAL SYSTEMS WITH INNER RESONANCES
✍ W.Y. Zhang; K. Huseyin; Y.S. Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 306 KB

In this paper, the normal forms and the related coefficients, of high dimensional inner resonant systems, are explored. Using a recently developed approach, calculations of normal forms (especially the related coefficients) are much easier, compared to the existing methods. A general four dimensiona