29 search results - page 4 / 6 » Cover-Incomparability Graphs of Posets |
SIAMDM
2008
13 years 7 months ago
2008
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
EJC
2008
13 years 8 months ago
2008
JGT
2007
13 years 7 months ago
2007
DM
2002
13 years 7 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...