✦ LIBER ✦

The 2-dimensional rigidity of certain families of graphs

✍ Scribed by Bill Jackson; Brigitte Servatius; Herman Servatius

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 168 KB
Volume: 54
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20196

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Properties of Certain Families of 2k-Cyc

Properties of Certain Families of 2k-Cycle-Free Graphs

✍ F Lazebnik; V.A Ustimenko; A.J Woldar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 233 KB

The L-series of Certain Rigid Calabi–Yau

The L-series of Certain Rigid Calabi–Yau Threefolds

✍ H.A Verrill 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 274 KB

The L-series of two Calabi Yau three-folds are found. In each case it is shown that the middle cohomology has dimension 2, and that (up to Euler factors at primes of bad reduction) the Mellin transform of the L-series of the middle cohomology is given by a modular form of weight four.

On the Edge-sets of Rigid and Corigid Gr

On the Edge-sets of Rigid and Corigid Graphs

✍ Pavol Hell; Jaroslav Nešetřil 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

Classification of certain subgraphs of t

Classification of certain subgraphs of the 3-dimensional grid

✍ Jan Kristian Haugland 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## 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

Families of graphs complete for the stro

Families of graphs complete for the strong perfect graph Conjecture

✍ D. G. Corneil 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true