✦ LIBER ✦

On the Recognition of Families of Graphs with Local Computations

✍ Scribed by I. Litovsky; Y. Metivier; W. Zielonka

Book ID: 112252143
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 767 KB
Volume: 118
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-local Model of Computations on Grap

Semi-local Model of Computations on Graphs to Break the Local Symmetry: Work in Progress

✍ Dobiesław Wróblewski 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 229 KB

On shortness exponents of families of gr

On shortness exponents of families of graphs

✍ Günter Ewald 📂 Article 📅 1973 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 326 KB

On the recognition of fuzzy circular int

On the recognition of fuzzy circular interval graphs

✍ Gianpaolo Oriolo; Ugo Pietropaoli; Gautier Stauffer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 291 KB

A note on the recognition of bisplit gra

A note on the recognition of bisplit graphs

✍ Atif Abueida; R. Sritharan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 138 KB

On the equivalence of families of local

On the equivalence of families of local diffeomorphisms

✍ G. R. Belitskii 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 171 KB

On local connectivity of graphs with giv

On local connectivity of graphs with given clique number

✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ κ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is