𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorially homogeneous graphs

✍ Scribed by Hikoe Enomoto

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
421 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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–

Combinatorial curvature for planar graph
Combinatorial curvature for planar graphs
✍ Yusuke Higuchi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Regarding an infinite planar graph __G__ as a discrete analogue of a noncompact simply connected Riemannian surface, we introduce the combinatorial curvature of __G__ corresponding to the sectional curvature of a manifold. We show this curvature has the property that its negative values

Combinatorial games on a graph
Combinatorial games on a graph
✍ Claude Berge 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Survey of various problems about combinatorial games. ## O. Introduction A combinatorial game is the situation where two players, usually called A and B, play alternately by selecting an element in a finite set X according to fixed rules; the first player to achieve a certain configuration has wo

Homogeneously representable interval gra
Homogeneously representable interval graphs
✍ Dale Skrien; John Gimbel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 258 KB

## We characterize those interval graphs G with the property that, for every vertex u, there exists an interval represention of G in which the interval representing 21 is the left-most (or right-most) interval in the representation.