160 search results - page 1 / 32 » On Planar Supports for Hypergraphs |
GD
2009
Springer
13 years 9 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
COMBINATORICS
2000
13 years 4 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
TAGT
1998
Springer
13 years 9 months ago
1998
Springer
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
