𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Universal Structure for N-Free Graphs

✍ Scribed by Covington, J.


Book ID
120101729
Publisher
Oxford University Press
Year
1989
Tongue
English
Weight
325 KB
Volume
s3-58
Category
Article
ISSN
0024-6115

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A lower bound for area-universal graphs
✍ Gianfranco Bilardi; Shiva Chaudhuri; Devdatt Dubhashi; K. Mehlhorn πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 525 KB
On universal graphs for planar oriented
✍ O.V. Borodin; A.V. Kostochka; J. NeΕ‘etΕ™il; A. Raspaud; E. Sopena πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi

A gradient bound for free boundary graph
✍ Daniela De Silva; David Jerison πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 169 KB πŸ‘ 1 views
The coordinate representation of a graph
✍ A.V. Ivashchenko πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 411 KB

Every graph can be represented as the intersection graph on a family of closed unit cubes in Euclidean space E". Cube vertices have integer coordinates. The coordinate matrix, A(G) = {v.~} of a graph G is defined by the set of cube coordinates. The imbedded dimension of a graph, BP(G), is a number