Skip to content

more undirected graph families #14

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 8, 2025
Merged

more undirected graph families #14

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions src/GraphProperties.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -105,28 +105,39 @@ 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?"),
(:GraphIsCograph, "Is an undirected graph a cograph?"),
(: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),
Expand Down
Loading