✦ LIBER ✦

On infinite bridged graphs and strongly dismantlable graphs

✍ Scribed by Norbert Polat

Book ID: 108316382
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 123 KB
Volume: 211
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00142-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gibbs Measures and Dismantlable Graphs

✍ Graham R. Brightwell; Peter Winkler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 272 KB

We model physical systems with ``hard constraints'' by the space Hom(G, H) of homomorphisms from a locally finite graph G to a fixed finite constraint graph H. Two homomorphisms are deemed to be adjacent if they differ on a single site of G. We investigate what appears to be a fundamental dichotomy

A Helly theorem for geodesic convexity i

A Helly theorem for geodesic convexity in strongly dismantlable graphs

✍ Norbert Polat 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A (finite or infinite) graph G is strongly dismantlable if its vertices can be linearly ordered x o ..... x~ so that, for each ordinal fl < ~, there exists a strictly increasing finite sequence (i~)0~<j~<n of ordinals such that i o = fl, i, = ct and xi~ +1 is adjacent with x~j and with all neighbors

On bridged graphs and cop-win graphs

✍ R.P Anstee; M Farber 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Strongly balanced graphs and random grap

Strongly balanced graphs and random graphs

✍ Andrzej Ruciński; Andrew Vince 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 455 KB

The concept of strongly balanced graph is introduced. It is shown that there exists a strongly balanced graph with u vertices and e edges if and only if I s u -1 s e s ( 2 " ) . This result is applied to a classic question of Erdos and Renyi: What is the probability that a random graph on n vertices

On isometric subgraphs of infinite bridg

On isometric subgraphs of infinite bridged graphs and geodesic convexity

✍ Norbert Polat 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Dismantlings and iterated clique graphs

✍ M.E Frı́as-Armenta; V Neumann-Lara; M.A Pizaña 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB