Resolve Issue #368 (edge-planarity... in doc)

digraphs · Mar 2, 2021 · 1c4a0f0 · 1c4a0f0
1 parent 297ea92
commit 1c4a0f0
Show file tree

Hide file tree

Showing 3 changed files with 43 additions and 2 deletions.
diff --git a/doc/digraphs.bib b/doc/digraphs.bib
@@ -1,7 +1,40 @@
 % Cite keys match the cite keys that are used in the compiled GAPDoc manual
 
+@article{B12,
+   author = {John M. Boyer},
+   title = {Subgraph Homeomorphism via the Edge Addition Planarity Algorithm},
+   journal = {Journal of Graph Algorithms and Applications},
+   year = {2012},
+   volume = {16},
+   number = {2},
+   pages = {381--410},
+   doi = {10.7155/jgaa.00268}
+}
+
+@article{BM04,
+   author = {John M. Boyer and Wendy J. Myrvold},
+   title = {On the Cutting Edge: Simplified O(n) Planarity by Edge Addition},
+   journal = {Journal of Graph Algorithms and Applications},
+   year = {2004},
+   volume = {8},
+   number = {3},
+   pages = {241--273},
+   doi = {10.7155/jgaa.00091}
+}
+
+@inproceedings{B06,
+  address = {Berlin, Heidelberg},
+  author = {John M. Boyer},
+  booktitle = {Graph Drawing},
+  editor = {Healy, Patrick and Nikolov, Nikola S.},
+  isbn = {978-3-540-31667-1},
+  pages = {508--511},
+  publisher = {Springer Berlin Heidelberg},
+  title = {A New Method for Efficiently Generating Planar Graph Visibility Representations},
+  year = {2006}}
+
 @incollection{BM06,
-  Author = {John M. Boyer and Wendy J. Myrvold},
+  author = {John M. Boyer and Wendy J. Myrvold},
   Booktitle = {Graph Algorithms and Applications 5},
   Doi = {10.1142/9789812773289_0014},
   Month = {Jun},

diff --git a/doc/z-chap0.xml b/doc/z-chap0.xml
@@ -50,6 +50,14 @@
   <Ref Sect="Isomorphisms and canonical labellings"/> for more details.  
   <P/>
 
+  The &edge-addition-planarity-suite; is also included in &Digraphs;; see
+  <Cite Key="BM04"/>, <Cite Key="B06"/>, <Cite Key="BM06"/>, and <Cite
+  Key="B12"/> .  The &edge-addition-planarity-suite; is an open-source
+  implementation of the edge addition planar graph embedding algorithm and
+  related algorithms by John M. Boyer. See Section <Ref Sect="Planarity"/> for
+  more details.
+  <P/>
+
   From version 1.0.0 of this package, digraphs can be either mutable or immutable.
   Mutable digraphs can be changed in-place by many of the methods in the
   package, which avoids unnecessary copying. Immutable digraphs cannot be

diff --git a/doc/z-chap5.xml b/doc/z-chap5.xml
@@ -42,7 +42,7 @@
     <#Include Label="IsCycleDigraph">
   </Section>
 
-  <Section><Heading>Planarity</Heading>
+  <Section Label="Planarity"><Heading>Planarity</Heading>
     <#Include Label="IsPlanarDigraph">
     <#Include Label="IsOuterPlanarDigraph">
   </Section>