diff --git a/src/generate_partial_k_tree.rs b/src/generate_partial_k_tree.rs
index b930939..5c3ada4 100644
--- a/src/generate_partial_k_tree.rs
+++ b/src/generate_partial_k_tree.rs
@@ -71,7 +71,7 @@ pub fn generate_partial_k_tree(
 
 /// Generates a [k-tree](https://en.wikipedia.org/wiki/K-tree) with n vertices and k in the definition.
 /// Returns None if k > n
-pub(crate) fn generate_k_tree(k: usize, n: usize) -> Option<Graph<i32, i32, Undirected>> {
+pub fn generate_k_tree(k: usize, n: usize) -> Option<Graph<i32, i32, Undirected>> {
     if k > n {
         None
     } else {
diff --git a/src/lib.rs b/src/lib.rs
index 4d9a76a..82a371a 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -30,7 +30,7 @@ pub(crate) use find_connected_components::find_connected_components;
 pub(crate) use find_maximum_cliques::{find_maximum_cliques, find_maximum_cliques_bounded};
 pub(crate) use find_width_of_tree_decomposition::find_width_of_tree_decomposition;
 pub use generate_partial_k_tree::{
-    generate_partial_k_tree, generate_partial_k_tree_with_guaranteed_treewidth,
+    generate_k_tree, generate_partial_k_tree, generate_partial_k_tree_with_guaranteed_treewidth,
 };
 pub(crate) use maximum_minimum_degree_heuristic::maximum_minimum_degree_plus;