graph families: improve Markdown formatting and wording (#15)

Author: nsajko

src/GraphProperties.jl

@@ -97,47 +97,47 @@ let
         (:Splittance, "The *splittance* of an undirected graph."),
     ]
     properties_bool = Tuple{Symbol, String}[
-        (:IsUndirectedGraph, "Is something an undirected graph?"),
-        (:IsDirectedGraph, "Is something a directed graph?"),
-        (:DigraphIsDAG, "Is a directed graph acyclic (a DAG)?"),
-        (:DigraphIsOrientation, "Is a directed graph an orientation?"),
-        (:GraphIsConnected, "Is an undirected graph connected?"),
-        (: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*."),
+        (:IsUndirectedGraph, "Is something an *undirected graph*?"),
+        (:IsDirectedGraph, "Is something a *directed graph*?"),
+        (:DigraphIsDAG, "Is a directed graph *acyclic* (a *directed acyclic graph*, also known as a *DAG*)?"),
+        (:DigraphIsOrientation, "Is a directed graph an *orientation*?"),
+        (:GraphIsConnected, "Is an undirected graph *connected*?"),
+        (: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),