✦ LIBER ✦

Dilation-free graphs in the l1 metric

✍ Scribed by J. Cáceres; C.I. Grima; A. Márquez; A. Moreno-González

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 164 KB
Volume: 49
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20152

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complementary ℓ1-Graphs Embeddable in th

Complementary ℓ1-Graphs Embeddable in the Half-Cube

✍ M.C. Marcusanu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 221 KB

A finite connected graph is called an 1 -graph if it can be isometrically embedded into the space 1 . We complete the classification of pairs of complementary 1 -graphs started by Deza and Huang, and continued by Shpectorov.

Metric Projection onto a Lattice in L1

✍ R. Huotari; S. Sahab 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 212 KB

In this note it is shown that the \(L_{1}\) metric projection onto a lattice is Lipschitz continuous, and that it has a Lipschitz continuous selection. (1) 1994 Academic Press, Inc.

Regular factors in K1,3-free graphs

✍ S. A. Choudum; M. S. Paulraj 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract We show that every connected __K__~1,3~‐free graph with minimum degree at least __2k__ contains a __k__‐factor and construct connected __K__~1,3~‐free graphs with minimum degree __k__ + __0__(√__k__) that have no __k__‐factor.

Regular factors in K1,n free graphs

✍ Yoshimi Egawa; Katsuhiro Ota 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract A graph is said to be __K__~1,__n__~‐free, if it contains no __K__~1,__n__~ as an induced subgraph. We prove that for __n__ ⩾ 3 and __r__ ⩾ __n__ −1, if __G__ is a __K__~1,__n__~‐free graph with minimum degree at least (__n__^2^/4(__n__ −1))__r__ + (3__n__ −6)/2 + (__n__ −1)/4__r__, the

Hamiltonian results in K1,3-free graphs

✍ M. M. Matthews; D. P. Sumner 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB 👁 1 views

There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K,,,-free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K,.3-free gra

Longest paths and cycles in K1,3-free gr

Longest paths and cycles in K1,3-free graphs

✍ Manton M. Matthews; David P. Sumner 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

In this article w e show that the standard results concerning longest paths and cycles in graphs can be improved for K,,,-free graphs. We obtain as a consequence of these results conditions for the existence of a hamiltonian path and cycle in K,,,-free graphs.