diff --git a/include/boost/graph/leda_graph.hpp b/include/boost/graph/leda_graph.hpp
index 5d1050d3..f1a7cfb2 100644
--- a/include/boost/graph/leda_graph.hpp
+++ b/include/boost/graph/leda_graph.hpp
@@ -173,6 +173,17 @@ namespace boost {
     typedef int edges_size_type;
     typedef int degree_size_type;
   };
+
+  template <class vtype, class etype>
+  struct vertex_property< GRAPH<vtype,etype> > {
+    typedef vtype type;
+  };
+
+  template <class vtype, class etype>
+  struct edge_property< GRAPH<vtype,etype> > {
+    typedef etype type;
+  };
+
 } // namespace boost
 #endif
 
@@ -294,6 +305,13 @@ namespace boost {
     return g.new_node();
   }
 
+  template <class vtype, class etype>
+  typename graph_traits< GRAPH<vtype,etype> >::vertex_descriptor
+  add_vertex(const vtype& vp, GRAPH<vtype,etype>& g)
+  {
+    return g.new_node(vp);
+  }
+
   // Hmm, LEDA doesn't have the equivalent of clear_vertex() -JGS
   // need to write an implementation
   template <class vtype, class etype>