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
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
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