1952 search results - page 31 / 391 » Complete partitions of graphs |
GD
1999
Springer
14 years 3 days ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
COMBINATORICA
2008
13 years 8 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
DM
2008
13 years 8 months ago
2008
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
JPDC
2000
13 years 7 months ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...