From cdb5c75d0bfc200241a78176636122503fe87215 Mon Sep 17 00:00:00 2001
From: Neven Sajko <s@purelymail.com>
Date: Wed, 8 Oct 2025 11:40:41 +0200
Subject: [PATCH] more undirected graph families

---
 src/GraphProperties.jl | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/src/GraphProperties.jl b/src/GraphProperties.jl
index 225ff96..908a96a 100644
--- a/src/GraphProperties.jl
+++ b/src/GraphProperties.jl
@@ -105,21 +105,31 @@ let
         (:DigraphIsWeaklyConnected, "Is a directed graph weakly connected?"),
         (:DigraphIsStronglyConnected, "Is a directed graph strongly connected?"),
         (:GraphIsBipartite, "Is an undirected graph bipartite?"),
+        (:GraphIsCompleteBipartite, "Is an undirected graph complete bipartite? Also known as *biclique*."),
         (:GraphIsPath, "Is an undirected graph a path?"),
         (:GraphIsCycle, "Is an undirected graph a cycle?"),
         (:GraphIsPlanar, "Is an undirected graph planar?"),
         (:DigraphIsPlanar, "Is a directed graph planar?"),
+        (:GraphIsOuterplanar, "Is an undirected graph outerplanar?"),
+        (:GraphIsMaximalOuterplanar, "Is an undirected graph maximal outerplanar?"),
         (:GraphIsTriangleFree, "Is an undirected graph triangle-free?"),
         (:GraphIsComplete, "Is an undirected graph complete?"),
         (:GraphIsRegular, "Is an undirected graph regular?"),
         (:GraphIsPerfect, "Is an undirected graph perfect?"),
         (:GraphIsTriviallyPerfect, "Is an undirected graph trivially perfect?"),
+        (:GraphIsModular, "Is an undirected graph modular?"),
+        (:GraphIsMedianGraph, "Is an undirected graph a median graph?"),
+        (:GraphIsSquaregraph, "Is an undirected graph a squaregraph?"),
         (:GraphIsForest, "Is an undirected graph a forest?"),
         (:GraphIsTree, "Is an undirected graph a tree?"),
+        (:GraphIsStar, "Is an undirected graph a star?"),
         (:GraphIsIndifferenceGraph, "Is an undirected graph an indifference graph?"),
         (:GraphIsIntervalGraph, "Is an undirected graph an interval graph?"),
         (:GraphIsPtolemaic, "Is an undirected graph Ptolemaic?"),
         (:GraphIsChordal, "Is an undirected graph chordal?"),
+        (:GraphIsStronglyChordal, "Is an undirected graph strongly chordal?"),
+        (:GraphIsDuallyChordal, "Is an undirected graph dually chordal? Note: a dually chordal graph is not always chordal."),
+        (:GraphIsChordalBipartite, "Is an undirected graph chordal bipartite? Note: a chordal bipartite graph is not always chordal."),
         (:GraphIsMeynielGraph, "Is an undirected graph a Meyniel graph?"),
         (:GraphIsCircleGraph, "Is an undirected graph a circle graph?"),
         (:GraphIsPermutationGraph, "Is an undirected graph a permutation graph?"),
@@ -127,6 +137,7 @@ let
         (:GraphIsComparabilityGraph, "Is an undirected graph a comparability graph?"),
         (:GraphIsDistanceHereditary, "Is an undirected graph distance-hereditary?"),
         (:GraphIsSplitGraph, "Is an undirected graph a split graph?"),
+        (:GraphIsCartesianProduct, "Is an undirected graph a Cartesian product of two graphs? Also known as the *box product*."),
     ]
     for (typ, properties) ∈ (
         (AbstractVector{<:Integer}, properties_abstractvector_integer),