36 search results - page 3 / 8 » gc 2010 |
GC
2010
Springer
14 years 10 months ago
2010
Springer
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
GC
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
GC
2010
Springer
14 years 10 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
IWMM
2010
Springer
15 years 1 months ago
2010
Springer
With the current developments in CPU implementations, it becomes obvious that ever more parallel multicore systems will be used even in embedded controllers that require real-time...
124
click to vote
GC
2010
Springer
14 years 10 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...