✦ LIBER ✦

On the graph of large distances

✍ Scribed by P. Erdős; L. Lovász; K. Vesztergombi

Book ID: 105489446
Publisher: Springer
Year: 1989
Tongue: English
Weight: 516 KB
Volume: 4
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187746

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the structure of distance graphs with

On the structure of distance graphs with large chromatic numbers

✍ A. M. Raigorodskii 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 383 KB

On embedding of finite distance graphs w

On embedding of finite distance graphs with large chromatic number in random graphs

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 293 KB

On the editing distance of graphs

✍ Maria Axenovich; André Kézdy; Ryan Martin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

## Abstract An edge‐operation on a graph __G__ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from __G__ to $\cal G$ is the smallest number of edge‐operations needed to modify __G__ into a graph

On the rotation distance of graphs

✍ R.J. Faudree; R.H. Schelp; L. Lesniak; A. Gyárfás; J. Lehel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Let (x,y) be an edge of a graph G. Then the rotation of (x, y) about x is the operation of removing (x, y) from G and inserting (x, y') as an edge, where y' is a vertex of G. The rotation distance between graphs G and H is the minimum number of rotations necessary to transform G into H. Lower and up

On the connectivity of unit distance gra

On the connectivity of unit distance graphs

✍ Michael Reid 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 587 KB

On the degree distance of a graph

✍ P. Dankelmann; I. Gutman; S. Mukwembi; H.C. Swart 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 373 KB