✦ LIBER ✦

On k-graceful, countably infinite graphs

✍ Scribed by Peter J Slater

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 718 KB
Volume: 61
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90100-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On skolem graceful graphs

✍ S.M. Lee; S.C. Shee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Lee, S.M. and SC. Shee, On Skolem graceful graphs, Discrete Mathematics 93 (1991) 195-200. A Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem graceful iff it is graceful. The Skolem deficiency of a graph is defined and Skolem deficiencies of some well-known graphs

On sparse countably infinite Steiner tri

On sparse countably infinite Steiner triple systems

✍ K. M. Chicot; M. J. Grannell; T. S. Griggs; B. S. Webb 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

## Abstract We give a general construction for Steiner triple systems on a countably infinite point set and show that it yields 2 nonisomorphic systems all of which are uniform and __r__‐sparse for all finite __r__⩾4. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 115–122, 2010

l-Regular rotations of the countably inf

l-Regular rotations of the countably infinite complete graph

✍ Mark Jungerman 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 998 KB

## All WWV . I-regular rotation of the infinite complete graph with countable vertex set is one in induced circuit is finite of kngth 1. I-regular rotations are exhibited for all 1 a 3. which Triangular rotations of finite graphs have been extensively studied. In particular, finding such rotation

On vertex k-partitions of certain infini

On vertex k-partitions of certain infinite graphs

✍ Douglas Cenzer; Edward Howorka 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 826 KB

Let G be an infinite graph; define de& G to be the least m such that any partition P of the vertex set of G into sets of uniformly bounded cardinality contains a set which is adjacent to at least m Other sets of the partition. If G is either a regular tree 01 a triangtiisr, sqzart or hexagonal plana

On the existence of countable universal

On the existence of countable universal graphs

✍ F�redi, Zolt�n; Komj�th, P�ter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 2 views

Let Forb(G) denote the class of graphs with countable vertex sets which do not contain G as a subgraph. If G is finite, 2-connected, but not complete, then Forb(G) has no element which contains every other element of Forb(G) as a subgraph, i.e., this class contains no universal graph.

Large k-preserving sets in infinite grap

Large k-preserving sets in infinite graphs

✍ Andreas Huck; Frank Niedermeyer; Saharon Shelah 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB

## Abstract Let __K__ be a cardinal. If __K__ χ~0~, define K:= __K__. Otherwise, let __K__ := __K__ + 1. We prove a conjecture of Mader: Every infinite __K__‐connected graph __G__ = (__V, E__) contains a set __S__ ⊆ __V__ with |__S__| = |__V__| such that __G/S__ is __K__‐connected for all __S__⊆ __