721 search results - page 13 / 145 » Almost universal graphs |
118
click to vote
EJC
2010
15 years 4 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
137
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
148
click to vote
DCG
2010
15 years 4 months ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
125
click to vote
ARSCOM
2004
15 years 4 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
131
click to vote
EJC
1998
15 years 4 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...