Search Sciweavers | Sciweavers

21984 search results - page 443 / 4397

» C

140

click to vote

DM
2002

104views more DM 2002»

4-connected maximal planar graphs are 4-ordered

15 years 6 months ago

Download www.cs.clemson.edu

It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...

Wayne Goddard

claim paper

Read More »

161

click to vote

COMBINATORICS
1999

90views more COMBINATORICS 1999»

New Bounds for Codes Identifying Vertices in Graphs

15 years 6 months ago

Download www.univie.ac.at

Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...

Gérard D. Cohen, Iiro S. Honkala, Antoine L...

claim paper

Read More »

176

click to vote

JVCA
2002

65views more JVCA 2002»

Scale-invariant segmentation of dynamic contrast-enhanced perfusion MR images with inherent scale selection

15 years 6 months ago