253 search results - page 25 / 51 » Perfection thickness of graphs |
JCT
2006
13 years 8 months ago
2006
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
MICCAI
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. We propose a novel framework to predict pacing sites in the left ventricle (LV) of a heart and its result can be used to assist pacemaker implantation and programming in ...
JGT
2006
13 years 8 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
DMTCS
2010
13 years 5 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
DM
2007
13 years 8 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...