𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homomorphically full graphs

✍ Scribed by Richard Brewster; Gary MacGillivray

Book ID
104183087
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
662 KB
Volume
66
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independence and graph homomorphisms gra
Independence and graph homomorphisms graph homomorphisms
✍ Michael O. Albertson; Lily Chan; Ruth Haas 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

## Abstract A graph with __n__ vertices that contains no triangle and no 5‐cycle and minimum degree exceeding __n__/4 contains an independent set with at least (3__n__)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism

Homomorphism–homogeneous graphs
Homomorphism–homogeneous graphs
✍ Momchil Rusinov; Pascal Schweitzer 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

## Abstract We answer two open questions posed by Cameron and Nesetril concerning homomorphism–homogeneous graphs. In particular we show, by giving a characterization of these graphs, that extendability to monomorphism or to homomorphism leads to the same class of graphs when defining homomorphism–

Geometric graph homomorphisms
Geometric graph homomorphisms
✍ Debra L. Boutin; Sally Cockburn 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract A __geometric graph__ is a simple graph drawn on points in the plane, in general position, with straightline edges. A __geometric__ __homomorphism__ from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geometric homomorphisms and

Extremal graphs for homomorphisms
Extremal graphs for homomorphisms
✍ Jonathan Cutler; A. J. Radcliffe 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed imag

Generalized homomorphism graph functions
Generalized homomorphism graph functions
✍ Lih-Hsing Hsu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A real-valued function f defined on the set of all graphs, 3, such that for all G, HE 52 is called multiplicative; and f(G) <f(H) w h enever G is a subgraph of H is called increasing. The classification of multiplicative increasing graph functions is still open. Up to now, there are a lot of known