|
|
Computational Methods
05-04
| [1] |
David Abelson, Seok-Hee Hong, and Donald E. Taylor.
A group-theoretic method for drawing graphs symmetrically.
In Graph Drawing, volume 2528 of Lecture Notes in
Comput. Sci., pages 86–97. Springer, Berlin, 2002. |
| [2] |
John M. Boyer and Wendy J. Myrvold.
On the cutting edge: Simplified O(n) planarity by edge
addition.
J. Graph Algorithms Appl., 8(3):241–273 (electronic), 2004. |
| [3] |
Florent Hivert and Nicolas M. Thiéry.
MuPAD-Combinat, an open-source package for research in algebraic
combinatorics.
Sém. Lothar. Combin., 51:Art. B51z, 70 pp. (electronic),
2004/05. |
| [4] |
Paulette Lieby.
Colouring planar graphs.
In Discovering Mathematics with Magma, volume 19 of Algorithms Comput. Math., pages 315–330. Springer, Berlin, 2006. |
| [5] |
Kozo Sugiyama, Seok-Hee Hong, and Atsuhiko Maeda.
The puzzle layout problem.
In Giuseppe Liotta, editor, Graph Drawing, Perugia, 2003, pages
500–501. Springer, 2004. |
|
