3471 search results - page 237 / 695 » Obstacle Numbers of Graphs |
137
Voted
DAM
2008
15 years 5 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
135
click to vote
DM
2008
15 years 5 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
151
click to vote
DM
2006
15 years 5 months ago
2006
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
107
click to vote
JGT
2006
15 years 5 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
140
click to vote
WG
2010
Springer
15 years 3 months ago
2010
Springer
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...