3268 search results - page 129 / 654 » The hub number of a graph |
147
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
170
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
131
click to vote
ARSCOM
2007
15 years 6 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
157
click to vote
CPC
2008
15 years 6 months ago
2008
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
148
click to vote
DM
2008
15 years 6 months ago
2008
We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our ...