commit c72ecccaac43da03d47aa1fa7df62c62e53ee711
parent 7f88bb78cbca59a7fdcc5dcd070744bf9b18675b
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Tue, 14 Jan 2025 15:04:36 +0100
commit with codex
Diffstat:
5 files changed, 18 insertions(+), 0 deletions(-)
diff --git a/connectivity b/connectivity
@@ -9,6 +9,9 @@ Problem of knowing how many edges/vertices you must remove from a [graph] in ord
- [dynamic_connectivity]
+- [strongly_connected_graph]
+- [weakly_connected_graph]
+
See also: [mengers_theorem], [minimum_cut], [connected_graph]
Up: [graph]
diff --git a/cycle b/cycle
@@ -15,6 +15,11 @@ Variants:
- [cycle_induced]
+Special cases:
+
+- [hamiltonian_cycle]
+- [eulerian_cycle]
+
Up: [graph_basic_notions]
Aliases: cycles
diff --git a/strongly_connected b/strongly_connected
@@ -2,6 +2,7 @@
- [strongly_connected_graph]
- [strongly_connected_language]
+- [strongly_connected_component]
Up: [mathematics]
diff --git a/strongly_connected_graph b/strongly_connected_graph
@@ -0,0 +1,7 @@
+# Strongly connected graph
+
+s
+
+A [directed_graph] having one [strongly_connected_component]
+
+Up: [strongly_connected]
diff --git a/universal_word b/universal_word
@@ -3,6 +3,8 @@
[chen2017universal]
[word] containing all words of length n exactly once as contiguous [subword]
+- always exists for any alphabet and length
+- cf [chung1992universal]
See also: [superpermutation], [random_universal_word], [de_bruijn_sequence], [universal_tree]
