---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/Combinatorics/Graphs/bibliography.html"
source: "https://docs.magma-maths.org/Combinatorics/Graphs/bibliography.md"
part: "Combinatorics"
chapter: "Graphs"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Combinatorics", "source": "../index-combinatorics.md"}
  - {"title": "Graphs", "source": "index-graphs.md"}
prev: {"title": "Graph Databases and Graph Generation", "source": "graph-databases.md"}
next: {"title": "Multigraphs", "source": "../Multigraphs/index-multigraphs.md"}
---

# Bibliography

<a id="cite-amo"></a>
- **[AMO93]** R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. *Network Flows, Theory, Algorithms, and Applications*. Prentice Hall, 1993.
<a id="cite-bw01"></a>
- **[BM01]** J. Boyer and W. Myrvold. Simplified O($n$) Planarity Algorithms. submitted, 2001.
<a id="cite-brel79"></a>
- **[Bre79]** D. Brelaz. New Methods to Color the Vertices of a Graph. *Communications of the ACM*, 22(9):251–256, 1979.
<a id="cite-bronkerb73"></a>
- **[BK73]** C. Bron and J. Kerbosch. Finding All Cliques of an Undirected Graph. *Communications of the ACM 9*, 16(9):575–577, 1973.
<a id="cite-christo75"></a>
- **[Chr75]** N. Christofides. *Graph Theory, An Algorithm Approach*. Academic Press, 1975.
<a id="cite-even"></a>
- **[Eve79]** Shimon Even. *Graph Algorithms*. Computer Science Press, 1979.
<a id="cite-gutmut01"></a>
- **[GM01]** C. Gutwenger and P. Mutzel. A Linear Time Implementation of SPQR-Trees. In J. Marks, editor, *Graph Drawing 2000*, volume 1984 of LNCS, pages 70–90. Springer-Verlag, 2001.
<a id="cite-hoptar73"></a>
- **[HT73]** J.E. Hopcroft and R.E. Tarjan. Dividing a Graph into Triconnected Components. *SIAM J. Comput.*, 2(3):135–158, 1973.
<a id="cite-lorimer"></a>
- **[Lor89]** P. Lorimer. The construction of Tutte's $8$-cage and the Conder graph. *J. of Graph Theory*, 13(5):553–557, 1989.
<a id="cite-bdm-nauty-paper"></a>
- **[McK81]** B. D. McKay. Practical Graph Isomorphism. *Congressus Numerantium*, 30:45–87, 1981.
<a id="cite-bdm-graph-gen"></a>
- **[McK98]** B. D. McKay. Isomorph-free exhaustive generation. *J. Algorithms*, 26:306–324, 1998.
<a id="cite-nauty-traces-manual"></a>
- **[MP]** B. D. McKay and A. Piperno. nauty and Traces User's Guide (Version 2.6). http://pallini.di.uniroma1.it/nug26.pdf.
<a id="cite-myrv"></a>
- **[MPW]** W. Myrvold, T. Prsa, and N. Walker. A Dynamic Programming Approach for Timing and Designing Clique Algorithms. available at http://www.csr.uvic.ca/ wendym/.
<a id="cite-corleiri"></a>
- **[TCR90]** C.E. Leiserson T.H. Cormen and R.L. Rivest. *Introduction to Algorithms*. MIT Press, 1990.