✦ LIBER ✦

On Locally Hoffman-Singleton Graphs

✍ Scribed by J. Vanbon

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 101 KB
Volume: 63
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On constructible graphs, locally Helly g

On constructible graphs, locally Helly graphs, and convexity

✍ Norbert Polat 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract A (finite or infinite) graph __G__ is __constructible__ if there exists a well‐ordering ≤ of its vertices such that for every vertex __x__ which is not the smallest element, there is a vertex __y__ < __x__ which is adjacent to __x__ and to every neighbor __z__ of __x__ with __z__ < __x_

A covering construction for packing disj

A covering construction for packing disjoint copies of the Hoffman-Singleton graph into K50

✍ Jana Ŝiagiová; Mariusz Meszka 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into __K__~50~. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience (www.interscience

Coloring Locally Bipartite Graphs on Sur

Coloring Locally Bipartite Graphs on Surfaces

✍ Bojan Mohar; Paul D. Seymour 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 129 KB

It is proved that there is a function f: N Q N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-width \ f(g). Then (i) If every contractible 4-cycle of G is facial and there is a face of size > 4, then G is 3-colorable.

Locally Pancyclic Graphs

✍ Ladislav Stacho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and d G (x)+d G ( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C 3 ,

On bounded automorphisms of locally fini

On bounded automorphisms of locally finite transitive graphs

✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

Locally s-distance transitive graphs

✍ Alice Devillers; Michael Giudici; Cai Heng Li; Cheryl E. Praeger 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB