160 search results - page 2 / 32 » On Planar Supports for Hypergraphs |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
STACS
2009
Springer
14 years 1 days ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
GD
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each...
SIAMDM
2008
13 years 5 months ago
2008
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...
EJC
2006
13 years 5 months ago
2006
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...