commit b508197fc3be90990b0da7ea8122c3ee05801581
parent d90fe3974b45bbf07e54b5b71ce33dff1b2b603d
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Thu, 19 Jun 2025 00:33:34 +0200
commit with codex
Diffstat:
3 files changed, 9 insertions(+), 5 deletions(-)
diff --git a/first_order_model_checking b/first_order_model_checking
@@ -14,6 +14,10 @@
- [first_order_model_checking_fok]
- [first_order_model_checking_fo2]
+## [parameterized_complexity]
+
+[fo_model_checking_parameterized_complexity]
+
Up: [model_checking] for [first_order_logic]
See also: [fine_grained_complexity], [clique_problem]
diff --git a/graph_h_minor_free b/graph_h_minor_free
@@ -12,4 +12,4 @@ Up: [graph_free]
See also: [graph_h_free]
-Aliases: H minor free, minor free, H minor free graph, H minor free graphs
+Aliases: H minor free, minor free, H minor free graph, H minor free graphs, excluded minor
diff --git a/twin_width b/twin_width
@@ -12,16 +12,16 @@ Recent generalization (2023-02): [flip_width]
- deciding whether the twin-width is at most 4 is [np_hard]
- graphs of twin-width 0 or 1 can be identified i [ptime]
-- [tree] has twin-width at most 2
+- [Trees] have twin-width at most 2
- so twin-width is at most 2 plus the [feedback_edge_number]
- incomparable with [nowhere_dense]
-- capture [excluded_minor] and bounded [cliquewidth]
+- capture [h_minor_free] and bounded [cliquewidth]
-guarantees that [first_order_model_checking] is [fixed_parameter_tractable] if the merge sequence is provided
+guarantees that [first_order_model_checking_parameterized_complexity] is [fixed_parameter_tractable] if the merge sequence is provided
[twin_width_ordered]
Up: [width_measure]
-See also: [nowhere_dense]
+See also: [nowhere_dense], [merge_width]
