✦ LIBER ✦

Characterization of grid graphs

✍ Scribed by Gustav Burosch; Jean-Marie Laborde

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 189 KB
Volume: 87
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90074-c

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we are mainly interested in the characterization of grid graphs i.e. products of paths.

📜 SIMILAR VOLUMES

On grid intersection graphs

✍ I.Ben-Arroyo Hartman; Ilan Newman; Ran Ziv 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Hartman I.B.-A., I. Newman and R. Ziv, On grid intersection graphs, Discrete Mathematics 87 (1991) 41-52. A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, y,) E E if and only if segm

Grid intersection graphs and boxicity

✍ S. Bellantoni; I. Ben-Arroyo Hartman; T. Przytycka; S. Whitesides 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 558 KB

A graph has hyuiciry k if k is the smallest integer such that G is an intersection graph of k-dimensional boxes in a &-dimensional space (where the sides of the boxes are parallel to the coordinate axis). A graph has grid dimension k if k is the smallest integer such that G is an intersection graph

Intersections of longest cycles in grid

Intersections of longest cycles in grid graphs

✍ Menke, B.; Zamfirescu, T.; Zamfirescu, C. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB 👁 3 views

It is well-known that the largest cycles of a graph may have empty intersection. This is the case, for example, for any hypohamiltonian graph. In the literature, several important classes of graphs have been shown to contain examples with the above property. This paper investigates a (nontrivial) cl

Grid Minors of Graphs on the Torus

✍ M. Degraaf; A. Schrijver 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Locally 4-by-4 grid graphs

✍ A. Blokhuis; A. E. Brouwer 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

We investigate locally grid graphs. The main results are (i) a characterization of the Johnson graphs (and certain quotients of these) as locally grid graphs such that two points at distance 2 have precisely four common neighbors, and (ii) a complete determination of all graphs that are locally a 4

Tenacity of complete graph products and

Tenacity of complete graph products and grids

✍ Choudum, S. A.; Priya, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB 👁 2 views

Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various parameters like connectivity, toughness, integrit