diff --git a/BGL/test/BGL/test_Face_filtered_graph.cpp b/BGL/test/BGL/test_Face_filtered_graph.cpp
index 2bab2e1d83c..d85c55353a4 100644
--- a/BGL/test/BGL/test_Face_filtered_graph.cpp
+++ b/BGL/test/BGL/test_Face_filtered_graph.cpp
@@ -5,8 +5,6 @@
 #include <CGAL/use.h>
 #include "test_Prefix.h"
 
-#include <boost/numeric/conversion/cast.hpp>
-
 #include <unordered_map>
 #include <unordered_set>
 #include <fstream>
@@ -80,7 +78,7 @@ void test_edge_iterators(const Graph& g)
   // do we iterate as many as that?
   edge_iterator eb, ee;
   boost::tie(eb, ee) = edges(fg);
-  assert(boost::numeric_cast<edges_size_type>(std::distance(eb, ee)) == num_edges(g));
+  assert(static_cast<edges_size_type>(std::distance(eb, ee)) == num_edges(g));
   id_map ids;
   unsigned int count = 0;
   for(boost::tie(eb, ee) = edges(fg); eb != ee; ++eb) {
diff --git a/BGL/test/BGL/test_graph_traits.cpp b/BGL/test/BGL/test_graph_traits.cpp
index 3d71af5a7c2..7c1a4e939d3 100644
--- a/BGL/test/BGL/test_graph_traits.cpp
+++ b/BGL/test/BGL/test_graph_traits.cpp
@@ -2,7 +2,6 @@
 
 #include <CGAL/use.h>
 
-#include <boost/numeric/conversion/cast.hpp>
 #include <unordered_set>
 
 typedef std::unordered_set<std::size_t>                        id_map;
@@ -68,7 +67,7 @@ void test_halfedge_iterators(const G& g)
   // do we iterate as many as that?
   halfedge_iterator hb, he;
   boost::tie(hb, he) = halfedges(g);
-  assert(boost::numeric_cast<halfedges_size_type>(std::distance(hb, he)) == num_halfedges(g));
+  assert(static_cast<halfedges_size_type>(std::distance(hb, he)) == num_halfedges(g));
 
   id_map ids;
   unsigned int count = 0;
@@ -94,7 +93,7 @@ void test_edge_iterators(const G& g)
   // do we iterate as many as that?
   edge_iterator eb, ee;
   boost::tie(eb, ee) = edges(g);
-  assert(boost::numeric_cast<edges_size_type>(std::distance(eb, ee)) == num_edges(g));
+  assert(static_cast<edges_size_type>(std::distance(eb, ee)) == num_edges(g));
 
   id_map ids;
   unsigned int count = 0;