21 search results - page 1 / 5 » A note on degree-constrained subgraphs |
DAM
2008
13 years 11 months ago
2008
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16...
APPROX
2008
Springer
14 years 20 days ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
GC
2011
Springer
13 years 5 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
IPL
2008
13 years 10 months ago
2008
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
DM
2008
13 years 11 months ago
2008