%% This BibTeX bibliography file was created using BibDesk.
%% https://bibdesk.sourceforge.io/

%% Created for James Mitchell at 2018-12-13 18:13:21 +0000 


%% Saved with string encoding Unicode (UTF-8) 



@incollection{Boyer2006aa,
	Author = {John M. Boyer and Wendy J. Myrvold},
	Booktitle = {Graph Algorithms and Applications 5},
	Date-Added = {2018-12-13 18:10:56 +0000},
	Date-Modified = {2018-12-13 18:11:05 +0000},
	Doi = {10.1142/9789812773289_0014},
	Month = {jun},
	Pages = {241--273},
	Publisher = {{WORLD} {SCIENTIFIC}},
	Title = {On the Cutting Edge: Simplified O(n) Planarity by Edge Addition},
	Url = {https://doi.org/10.1142/9789812773289_0014},
	Year = {2006},
	Bdsk-Url-1 = {https://doi.org/10.1142/9789812773289_0014}}

@article{McKay201494,
	Author = {Brendan D. McKay and Adolfo Piperno},
	Doi = {http://dx.doi.org/10.1016/j.jsc.2013.09.003},
	Issn = {0747-7171},
	Journal = {Journal of Symbolic Computation},
	Number = {0},
	Pages = {94 - 112},
	Title = {Practical graph isomorphism, \{II\}},
	Url = {http://www.sciencedirect.com/science/article/pii/S0747717113001193},
	Volume = {60},
	Year = {2014},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0747717113001193},
	Bdsk-Url-2 = {http://dx.doi.org/10.1016/j.jsc.2013.09.003}}

@article{Gabow2000aa,
	Author = {Harold N. Gabow},
	Date-Added = {2014-09-15 09:28:26 +0000},
	Date-Modified = {2014-09-15 09:28:40 +0000},
	Doi = {http://dx.doi.org/10.1016/S0020-0190(00)00051-X},
	Issn = {0020-0190},
	Journal = {Information Processing Letters},
	Keywords = {Algorithms},
	Number = {34},
	Pages = {107 - 114},
	Title = {Path-based depth-first search for strong and biconnected components},
	Url = {http://www.sciencedirect.com/science/article/pii/S002001900000051X},
	Volume = {74},
	Year = {2000},
	Bdsk-File-1 = {YnBsaXN0MDDSAQIDBFxyZWxhdGl2ZVBhdGhZYWxpYXNEYXRhXxBNLi4vLi4vLi4vLi4vLi4vLi4vVm9sdW1lcy9Hb29nbGVEcml2ZS9GaWxlZC8xLXMyLjAtUzAwMjAwMTkwMDAwMDA1MVgtbWFpbi5wZGZPEQGOAAAAAAGOAAIAAAtHb29nbGVEcml2ZQAAAAAAAAAAAAAAAAAAAAAAAAAAQkQAAf////8fMS1zMi4wLVMwMDIwMDE5MDAwI0ZGRkZGRkZGLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/////wAAAAAAAAAAAAAAAP////8AABIAY3UAAAAAAAAAAAAAAAAABUZpbGVkAAACAD0vOlZvbHVtZXM6R29vZ2xlRHJpdmU6RmlsZWQ6MS1zMi4wLVMwMDIwMDE5MDAwMDAwNTFYLW1haW4ucGRmAAAOAEQAIQAxAC0AcwAyAC4AMAAtAFMAMAAwADIAMAAwADEAOQAwADAAMAAwADAAMAA1ADEAWAAtAG0AYQBpAG4ALgBwAGQAZgAPABgACwBHAG8AbwBnAGwAZQBEAHIAaQB2AGUAEgAoL0ZpbGVkLzEtczIuMC1TMDAyMDAxOTAwMDAwMDUxWC1tYWluLnBkZgATABQvVm9sdW1lcy9Hb29nbGVEcml2Zf//AAAACAANABoAJAB0AAAAAAAAAgEAAAAAAAAABQAAAAAAAAAAAAAAAAAAAgY=},
	Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S002001900000051X},
	Bdsk-Url-2 = {http://dx.doi.org/10.1016/S0020-0190(00)00051-X}}

@inproceedings{JunttilaKaski,
	Author = {Tommi Junttila and Petteri Kaski},
	Booktitle = {Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics},
	Editor = {David Applegate and Gerth St{\o}lting Brodal and Daniel Panario and Robert Sedgewick},
	Optaddress = {New Orleans, LA},
	Optmonth = {January 6},
	Optpublisher = {Society for Industrial and Applied Mathematics},
	Pages = {135--149},
	Publisher = {SIAM},
	Title = {Engineering an efficient canonical labeling tool for large and sparse graphs},
	Year = {2007}}

@article{CalderbankKantor1986,
	Author = {Calderbank, R. and Kantor, W. M.},
	Coden = {LMSBBT},
	Doi = {10.1112/blms/18.2.97},
	Fjournal = {The Bulletin of the London Mathematical Society},
	Issn = {0024-6093},
	Journal = {Bull. London Math. Soc.},
	Mrclass = {51E20 (05B25 05C25 94B60)},
	Mrnumber = {818812 (87h:51022)},
	Mrreviewer = {J. W. P. Hirschfeld},
	Number = {2},
	Pages = {97--122},
	Title = {The geometry of two-weight codes},
	Url = {http://dx.doi.org/10.1112/blms/18.2.97},
	Volume = {18},
	Year = {1986},
	Bdsk-Url-1 = {http://dx.doi.org/10.1112/blms/18.2.97}}

@article{vanLintSchrijver1981,
	Author = {van Lint, J. H. and Schrijver, A.},
	Coden = {COMBDI},
	Doi = {10.1007/BF02579178},
	Fjournal = {Combinatorica. An International Journal of the J\'anos Bolyai Mathematical Society},
	Issn = {0209-9683},
	Journal = {Combinatorica},
	Mrclass = {05B25 (05C25 94B25)},
	Mrnumber = {602417 (82d:05041)},
	Mrreviewer = {Joseph A. Thas},
	Number = {1},
	Pages = {63--73},
	Title = {Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields},
	Url = {http://dx.doi.org/10.1007/BF02579178},
	Volume = {1},
	Year = {1981},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02579178}}

@article{Welsh1967aa,
	Author = {Welsh, D. J. A. and Powell, M. B.},
	Doi = {10.1093/comjnl/10.1.85},
	Eprint = {/oup/backfile/content_public/journal/comjnl/10/1/10.1093/comjnl/10.1.85/2/100085.pdf},
	Journal = {The Computer Journal},
	Number = {1},
	Pages = {85-86},
	Title = {An upper bound for the chromatic number of a graph and its application to timetabling problems},
	Url = {http://dx.doi.org/10.1093/comjnl/10.1.85},
	Volume = {10},
	Year = {1967},
	Bdsk-Url-1 = {http://dx.doi.org/10.1093/comjnl/10.1.85}}
