3204 search results - page 122 / 641 » The b-chromatic Number of a Graph |
COMBINATORICA
2008
13 years 10 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
COMBINATORICA
2007
13 years 10 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
AUSAI
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...