𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Center Cycles in Grid Graphs

✍ Scribed by Les R. Foulds; Horst W. Hamacher; Anita Schöbel; Tadashi Yamaguchi

Book ID
111558471
Publisher
Springer US
Year
2003
Tongue
English
Weight
108 KB
Volume
122
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Matrix Method for Counting Hamiltonian
A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs
✍ Y.H.Harris Kwong; D.G. Rogers 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 154 KB

A matrix method is used to determine the number of Hamiltonian cycles on \(P_{m} \times P_{n}, m=4\), 5. This provides an alternative to other approaches which had been used to solve the problem. The method and its more generalized version, transfer-matrix method, may give easier solutions to cases

On grid intersection graphs
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

Locally geodesic cycles in 2-self-center
Locally geodesic cycles in 2-self-centered graphs
✍ Seiya Negami; Guang-Han Xu 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 333 KB

A cycle C in G is said to be locally geodesic at a vertex v if for each vertex u on C, the distance between v and u in C coincides with that in G. It will be shown that a self-centered graph of radius 2 contains a cycle of length 4 or 5 which is locally geodesic at each vertex and conversely that if