Sciweavers

133 search results - page 10 / 27
» Subgraphs with restricted degrees of their vertices in plana...
Sort
View
SIAMDM
2008
97views more  SIAMDM 2008»
13 years 8 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov
IPL
2007
81views more  IPL 2007»
13 years 8 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston
ARSCOM
2007
81views more  ARSCOM 2007»
13 years 8 months ago
Graphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
Michael Ferrara, Ronald J. Gould, John R. Schmitt
JGT
2008
88views more  JGT 2008»
13 years 8 months ago
On k-detour subgraphs of hypercubes
A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at mo...
Nana Arizumi, Peter Hamburger, Alexandr V. Kostoch...
IM
2008
13 years 8 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin