1395 search results - page 78 / 279 » (k, )-Distance-Hereditary Graphs |
113
Voted
SIAMDM
2008
15 years 3 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
111
Voted
CPC
2000
15 years 3 months ago
2000
A recently posed question of H
115
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
131
Voted
IPL
2010
15 years 2 months ago
2010
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
124
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...