diff --git a/BGL/test/BGL/test_Properties.cpp b/BGL/test/BGL/test_Properties.cpp
index 206e7feb202..4c0a44bacfb 100644
--- a/BGL/test/BGL/test_Properties.cpp
+++ b/BGL/test/BGL/test_Properties.cpp
@@ -64,7 +64,7 @@ void index_uniqueness_omesh(const OMesh& g)
 
 
 int
-main( int argc, char* argv[] )
+main()
 {
   std::vector<Polyhedron> polys = poly_data();
 
diff --git a/BGL/test/BGL/test_graph_geometry.cpp b/BGL/test/BGL/test_graph_geometry.cpp
index 1bb87e134a9..65cae1b97d0 100644
--- a/BGL/test/BGL/test_graph_geometry.cpp
+++ b/BGL/test/BGL/test_graph_geometry.cpp
@@ -13,7 +13,6 @@ void triangle_test()
   }
   typedef boost::graph_traits<Polyhedron> Traits;
   typedef Traits::face_iterator face_iterator;
-  typedef Traits::face_iterator edge_descriptor;
   typedef Traits::vertex_descriptor vertex_descriptor;
 
   face_iterator fb, fe;
diff --git a/BGL/test/BGL/test_graph_traits.cpp b/BGL/test/BGL/test_graph_traits.cpp
index c4cb5d3f0ab..f05e6c6d07e 100644
--- a/BGL/test/BGL/test_graph_traits.cpp
+++ b/BGL/test/BGL/test_graph_traits.cpp
@@ -98,10 +98,8 @@ void test_out_edges(const G& g)
 {
   typedef boost::graph_traits< G > Traits;
   typedef typename Traits::vertex_iterator vertex_iterator;
-  typedef typename Traits::in_edge_iterator in_edge_iterator;
   typedef typename Traits::out_edge_iterator out_edge_iterator;
   typedef typename Traits::vertex_descriptor vertex_descriptor;
-  typedef typename Traits::edge_descriptor edge_descriptor;
 
   vertex_iterator vb, ve;
   for(boost::tie(vb, ve) = vertices(g); vb != ve; ++vb) {
@@ -128,9 +126,7 @@ void test_in_edges(const G& g)
   typedef boost::graph_traits< G > Traits;
   typedef typename Traits::vertex_iterator vertex_iterator;
   typedef typename Traits::in_edge_iterator in_edge_iterator;
-  typedef typename Traits::out_edge_iterator out_edge_iterator;
   typedef typename Traits::vertex_descriptor vertex_descriptor;
-  typedef typename Traits::edge_descriptor edge_descriptor;
 
   vertex_iterator vb, ve;
   for(boost::tie(vb, ve) = vertices(g); vb != ve; ++vb) {
@@ -157,7 +153,6 @@ void test_in_out_edges(const G& g)
   typedef typename Traits::in_edge_iterator in_edge_iterator;
   typedef typename Traits::out_edge_iterator out_edge_iterator;
   typedef typename Traits::vertex_descriptor vertex_descriptor;
-  typedef typename Traits::edge_descriptor edge_descriptor;
 
   // check that the sets of in out edges are the same
   vertex_iterator vb, ve;
@@ -195,7 +190,6 @@ template<typename G>
 void test_edge_find(const G& g)
 {
   typedef boost::graph_traits<G>    Traits;
-  typedef typename Traits::vertex_iterator   vertex_iterator;
   typedef typename Traits::edge_iterator     edge_iterator;
   typedef typename Traits::vertex_descriptor vertex_descriptor;
   typedef typename Traits::edge_descriptor   edge_descriptor;
@@ -218,10 +212,7 @@ template<typename G>
 void test_faces(const G& g)
 {
   typedef boost::graph_traits<G>                         Traits;
-  typedef typename Traits::vertex_iterator               vertex_iterator;
-  typedef typename Traits::edge_iterator                 edge_iterator;
   typedef typename Traits::face_iterator                 face_iterator;
-  typedef typename Traits::vertex_descriptor             vertex_descriptor;
   typedef typename Traits::halfedge_descriptor           halfedge_descriptor;
   typedef CGAL::Halfedge_around_face_iterator<G>         halfedge_around_face_iterator;