376 search results - page 15 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
123
click to vote
CCCG
2003
15 years 3 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
122
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
125
click to vote
WG
2001
Springer
15 years 6 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
106
click to vote
JGT
2006
15 years 1 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
110
click to vote
IPL
2010
15 years 10 days ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...