✦ LIBER ✦

The Minimum Vertex Degree of a Graph on Uniform Points in [0,1]d

✍ Scribed by Martin J. B. Appel and Ralph P. Russo

Book ID: 125064827
Publisher: Applied Probability Trust
Year: 1997
Tongue: English
Weight: 889 KB
Volume: 29
Category: Article
ISSN: 0001-8678
DOI: 10.2307/1428077

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The connectivity of a graph on uniform p

The connectivity of a graph on uniform points on [0,1]d

✍ Martin J.B. Appel; Ralph P. Russo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A note on the vertex-distinguishing prop

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree

✍ Cristina Bazgan; Amel Harkat-Benhamdine; Hao Li; Mariusz Woźniak 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

A note on the minimum size of a vertex p

A note on the minimum size of a vertex pancyclic graph

✍ H.J. Broersma 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

An approximation of the minimum vertex c

An approximation of the minimum vertex cover in a graph

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1999 🏛 Japan Society for Industrial and Applied Mathemati 🌐 English ⚖ 464 KB

On computing the minimum feedback vertex

On computing the minimum feedback vertex set of a directed graph by contraction operations

✍ Hen-Ming Lin; Jing-Yang Jou 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 294 KB

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in