✦ LIBER ✦

Local expansions on graphs and order of a point

✍ Scribed by J. J. Charatonik; S. Miklos

Publisher: Akadmiai Kiad
Year: 1986
Tongue: English
Weight: 688 KB
Volume: 47
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01953966

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a point of order

✍ D. W. Wood; J. K. Ball 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 533 KB

A note on local colorings of graphs

✍ Andrzej Ruciński; Miroslaw Truszczyński 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Recently, R6dl and Rucifiski [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 -p. We write F ~ (G)r if for every r-coloring of t

A note on graphs and sphere orders

✍ Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract A partially ordered set __P__ is called a __k‐sphere order__ if one can assign to each element a ∈ __P__ a ball __B__~__a__~ in __R^k^__ so that __a__ < __b__ iff __B__~__a__~ ⊂ __B__~__b__~. To a graph __G__ = (__V,E__) associate a poset __P__(__G__) whose elements are the vertices and

On the point-core of a graph

✍ Frank Harary; Michael D. Plummer 📂 Article 📅 1966 🏛 Springer-Verlag 🌐 French ⚖ 245 KB

On local and global independence numbers

On local and global independence numbers of a graph

✍ Ralph J. Faudree; Zdeněk Ryjáček; Richard H. Schelp 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 121 KB

The local independence number i (G) of a graph G at a distance i is the maximum number of independent vertices at distance i from any vertex. We study the impact of restricting i (G) on the (global) independence number (G). Among others, we show that in graphs with bounded diameter, (G) is bounded i

On graphs satisfying a local ore-type co

On graphs satisfying a local ore-type condition

✍ Asratian, A. S.; Broersma, H. J.; Van den Heuvel, J.; Veldman, H. J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB 👁 1 views

For an integer i, a graph is called an L,-graph if, for each triple of vertices u, u , w with and Khachatrian proved that connected Lo-graphs of order a t least 3 are hamiltonian, thus improving Ore's Theorem. All K1,3-free graphs are L1-graphs, whence recognizing hamiltonian L1-graphs is an NP-com