@string{UVic = "Department of Computer Science, University of Victoria"}
@string{UVicAddress = "Victoria, B.C."}

@book {Gibbons,
    AUTHOR = {Gibbons, Alan},
     TITLE = {Algorithmic graph theory},
 PUBLISHER = {Cambridge University Press, Cambridge},
      YEAR = {1985},
     PAGES = {xii+259},
      ISBN = {0-521-24659-8; 0-521-28881-9},
   MRCLASS = {68R10 (68Q20 90Bxx)},
  MRNUMBER = {806954},
MRREVIEWER = {H. T. Lau},
}
	

% Not previously referenced but suggested by referee.

@incollection {chimani,
    AUTHOR = {Chimani, M. and Klein, K.},
     TITLE = {Algorithm Engineering: {C}oncepts and Practice},
 BOOKTITLE = {Experimental Methods for the Analysis of Optimization Algorithms},
    EDITOR = {T. Bartz-Beielstein and  M. Chiarandini and L. Paquete and M. Preuss}, 
     PAGES = {131--158},
 PUBLISHER = {Springer-Verlag},
      YEAR = {2010},
}

%  [1] D. Archdeacon. A Kuratowski theorem for the projective plane. Journal
%  of Graph Theory, 5:243–246, 1981.

@article {archdeacon2,
    AUTHOR = {Archdeacon, Dan},
     TITLE = {A {K}uratowski theorem for the projective plane},
   JOURNAL = {J. Graph Theory},
  FJOURNAL = {Journal of Graph Theory},
    VOLUME = {5},
      YEAR = {1981},
    NUMBER = {3},
     PAGES = {243--246},
      ISSN = {0364-9024},
     CODEN = {JGTHDO},
   MRCLASS = {05C10},
  MRNUMBER = {625065 (83b:05056)},
       DOI = {10.1002/jgt.3190050305},
       URL = {http://dx.doi.org/10.1002/jgt.3190050305},
}
	
@book {archdeacon_thesis,
    AUTHOR = {Archdeacon, Dan Steven},
     TITLE = {A {KURATOWSKI} {THEOREM} {FOR} {THE} {PROJECTIVE} {PLANE}},
      NOTE = {Thesis (Ph.D.)--The Ohio State University},
 PUBLISHER = {ProQuest LLC, Ann Arbor, MI},
      YEAR = {1980},
     PAGES = {224},
   MRCLASS = {Thesis},
  MRNUMBER = {2630871},
       URL =
              {http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:8100103},
}


%  [2] D. Archdeacon and J. P. Huneke. A Kuratowski theorem for nonorientable
%  surfaces. Journal of Combinatorial Theory. Series B, 46:173–
%  231, 1989.

@article {archdeacon1,
    AUTHOR = {Archdeacon, Dan and Huneke, Phil},
     TITLE = {A {K}uratowski theorem for nonorientable surfaces},
   JOURNAL = {J. Combin. Theory Ser. B},
  FJOURNAL = {Journal of Combinatorial Theory. Series B},
    VOLUME = {46},
      YEAR = {1989},
    NUMBER = {2},
     PAGES = {173--231},
      ISSN = {0095-8956},
     CODEN = {JCBTB8},
   MRCLASS = {05C10 (57N05)},
  MRNUMBER = {992991 (90f:05049)},
MRREVIEWER = {S. C. Althoen},
       DOI = {10.1016/0095-8956(89)90043-9},
       URL = {http://dx.doi.org/10.1016/0095-8956(89)90043-9},
}
		

%  [3] T. Asano. An approach to the subgraph homeomorphism problem. Theoretical
%  Computer Science, 38(2-3):249–267, 1985.

@article {asano,
    AUTHOR = {Asano, Takao},
     TITLE = {An approach to the subgraph homeomorphism problem},
   JOURNAL = {Theoret. Comput. Sci.},
  FJOURNAL = {Theoretical Computer Science},
    VOLUME = {38},
      YEAR = {1985},
    NUMBER = {2-3},
     PAGES = {249--267},
      ISSN = {0304-3975},
     CODEN = {TCSDI},
   MRCLASS = {05C99 (05-04)},
  MRNUMBER = {807925 (87a:05122)},
MRREVIEWER = {Carsten Thomassen},
       DOI = {10.1016/0304-3975(85)90222-1},
       URL = {http://dx.doi.org/10.1016/0304-3975(85)90222-1},
}
			     

%  [4] Joseph Battle, Frank Harary, Yukihiro Kodama, and J.W.T. Youngs.
%  Additivity of the genus of a graph. American Mathematical Society
%  Bulletins, 68:565–568, 1962.

@article {genus:BHKY,
    AUTHOR = {Battle, Joseph and Harary, Frank and Kodama, Yukihiro and
              Youngs, J. W. T.},
     TITLE = {Additivity of the genus of a graph},
   JOURNAL = {Bull. Amer. Math. Soc.},
  FJOURNAL = {Bulletin of the American Mathematical Society},
    VOLUME = {68},
      YEAR = {1962},
     PAGES = {565--568},
      ISSN = {0002-9904},
   MRCLASS = {55.10},
  MRNUMBER = {0155313 (27 \#5247)},
MRREVIEWER = {G. A. Dirac},
}

%  [5] R. Bodendiek and K. Wagner. Solution to K¨onig’s graph embedding
%  problem. Mathematische Nachrichten, 140:251–272, 1989.

@article {bodendiek,
    AUTHOR = {Bodendiek, R. and Wagner, K.},
     TITLE = {Solution to {K}\"onig's graph embedding problem},
   JOURNAL = {Math. Nachr.},
  FJOURNAL = {Mathematische Nachrichten},
    VOLUME = {140},
      YEAR = {1989},
     PAGES = {251--272},
      ISSN = {0025-584X},
     CODEN = {MTMNAQ},
   MRCLASS = {05C10},
  MRNUMBER = {1015399 (91g:05033)},
       DOI = {10.1002/mana.19891400118},
       URL = {http://dx.doi.org/10.1002/mana.19891400118},
}

%  [6] K. S. Booth and G. S. Lueker. Testing for the consecutive ones property,
%  interval graphs, and graph planarity using PQ–tree algorithms. Journal
%  of Computer and System Sciences, 13:335–379, 1976.

@article {genus:BoothLueker,
    AUTHOR = {Booth, Kellogg S. and Lueker, George S.},
     TITLE = {Testing for the consecutive ones property, interval graphs,
              and graph planarity using {$PQ$}-tree algorithms},
      NOTE = {Working Papers presented at the ACM-SIGACT Symposium on the
              Theory of Computing (Albuquerque, N. M., 1975)},
   JOURNAL = {J. Comput. System Sci.},
  FJOURNAL = {Journal of Computer and System Sciences},
    VOLUME = {13},
      YEAR = {1976},
    NUMBER = {3},
     PAGES = {335--379},
      ISSN = {0022-0000},
   MRCLASS = {68A10},
  MRNUMBER = {0433962 (55 \#6932)},
MRREVIEWER = {Jean H. Bevis},
}
	
@incollection {genus:BoothLueker_conf,
    AUTHOR = {Booth, Kellogg S. and Lueker, George S.},
     TITLE = {Linear algorithms to recognize interval graphs and test for
              the consecutive ones property},
 BOOKTITLE = {Seventh {A}nnual {ACM} {S}ymposium on {T}heory of {C}omputing
              ({A}lbuquerque, {N}. {M}., 1975)},
     PAGES = {255--265},
 PUBLISHER = {Assoc. Comput. Mach., New York},
      YEAR = {1975},
   MRCLASS = {68A05},
  MRNUMBER = {0428757 (55 \#1777)},
MRREVIEWER = {Jean H. Bevis},
}
		
%  [7] J. Boyer and W. Myrvold. Stop minding your P’s and Q’s: A simplified
%  O(n) planar embedding algorithm. Proceedings of the Tenth Annual
%  ACM-SIAM Symposium on Discrete Algorithms, pages 140–146, 1999.

@inproceedings {BM99,
    AUTHOR = {Boyer, John and Myrvold, Wendy},
     TITLE = {Stop minding your {P}'s and {Q}'s: a simplified {$O(n)$}
              planar embedding algorithm},
 BOOKTITLE = {Proceedings of the {T}enth {A}nnual {ACM}-{SIAM} {S}ymposium
              on {D}iscrete {A}lgorithms ({B}altimore, {MD}, 1999)},
     PAGES = {140--146},
 PUBLISHER = {ACM, New York},
      YEAR = {1999},
   MRCLASS = {68R10 (05C10 05C85 68P05)},
  MRNUMBER = {1739940},
}

@article {boyer_journal,
    AUTHOR = {Boyer, John M. and Myrvold, Wendy J.},
     TITLE = {On the cutting edge: simplified {$O(n)$} planarity by edge
              addition},
   JOURNAL = {J. Graph Algorithms Appl.},
  FJOURNAL = {Journal of Graph Algorithms and Applications},
    VOLUME = {8},
      YEAR = {2004},
    NUMBER = {3},
     PAGES = {241--273},
      ISSN = {1526-1719},
   MRCLASS = {05C10 (05C85 68P05 68Q25)},
  MRNUMBER = {2166815 (2006f:05050)},
MRREVIEWER = {J{\'e}r{\^o}me Monnot},
       DOI = {10.7155/jgaa.00091},
       URL = {http://dx.doi.org/10.7155/jgaa.00091},
}

@article {boyer_sub,
    AUTHOR = {Boyer, John M.},
     TITLE = {Subgraph homeomorphism via the edge addition planarity
              algorithm},
   JOURNAL = {J. Graph Algorithms Appl.},
  FJOURNAL = {Journal of Graph Algorithms and Applications},
    VOLUME = {16},
      YEAR = {2012},
    NUMBER = {2},
     PAGES = {381--410},
      ISSN = {1526-1719},
   MRCLASS = {05C10},
  MRNUMBER = {2971255},
       DOI = {10.7155/jgaa.00268},
       URL = {http://dx.doi.org/10.7155/jgaa.00268},
}
@incollection {boyer_impl,
    AUTHOR = {Boyer, John M. and Cortese, Pier Francesco and Patrignani,
              Maurizio and Di Battista, Giuseppe},
     TITLE = {Stop minding your {P}'s and {Q}'s: implementing a fast and
              simple {DFS}-based planarity testing and embedding algorithm},
 BOOKTITLE = {Graph drawing},
    SERIES = {Lecture Notes in Comput. Sci.},
    VOLUME = {2912},
     PAGES = {25--36},
 PUBLISHER = {Springer, Berlin},
      YEAR = {2004},
   MRCLASS = {68R10 (05C10 05C85)},
  MRNUMBER = {2177580},
       DOI = {10.1007/978-3-540-24595-7_3},
       URL = {http://dx.doi.org/10.1007/978-3-540-24595-7_3},
}
	



%  [8] J. Chambers. Hunting for torus obstructions. Master’s thesis, Department
%  of Computer Science, University of Victoria, Victoria, B.C., 2002.
%  19

@mastersthesis{jchambersthesis,
        title = "Hunting for Torus Obstructions",
        author = "J. Chambers",
        institution = UVic,
        school = UVic,
        address = UVicAddress,
        year = 2002
}

%  [9] H. de Fraysseix and P. Rosentiehl. A depth-first search characterization
%  of planarity. Ann. Discrete Math., 13:75–80, 1982.

@article{FrRo,
	author={H. de Fraysseix and P. Rosentiehl},
	title={A characterization of planar graphs by Tr\'{e}maux orders},
	journal={Combinatorica},
	volume={5},
	number={2},
	pages={127--135},
	year={1985}}

@article{FrRo2,
	author={H. de Fraysseix and P. Rosentiehl},
	title={A depth-first search characterization of planarity},
	journal={Ann. Discrete Math.},
	volume={13},
	pages={75--80},
	year={1982}}

%  [10] G. Demoucron, Y. Malgrange, and R. Pertuiset. Graphes planaires.
%  Revue Francaise Recherche Operationnelle, 8:33–47, 1964.

@article{demoucron,
        author = "G. Demoucron and Y. Malgrange and R. Pertuiset",
        title = "Graphes planaires",
        journal = "Revue Francaise Recherche Operationnelle",
        year = "1964",
        volume = "8",
        pages = "33-47"
}


%  [11] Andrei Gagarin and William Kocay. Embedding graphs containing K5-
%  subdivisions. Ars Combinatoria, 64:33–50, 2002.

@article {k5tok33_torus,
    AUTHOR = {Gagarin, Andrei and Kocay, William},
     TITLE = {Embedding graphs containing {$K_5$}-subdivisions on the
              torus},
   JOURNAL = {J. Combin. Math. Combin. Comput.},
  FJOURNAL = {Journal of Combinatorial Mathematics and Combinatorial
              Computing},
    VOLUME = {80},
      YEAR = {2012},
     PAGES = {207--223},
      ISSN = {0835-3026},
   MRCLASS = {05C10},
  MRNUMBER = {2918787},
MRREVIEWER = {Bharati Rajan},
}

@article {k5tok33,
    AUTHOR = {Gagarin, Andrei and Kocay, William},
     TITLE = {Embedding graphs containing {$K_5$}-subdivisions},
   JOURNAL = {Ars Combin.},
  FJOURNAL = {Ars Combinatoria},
    VOLUME = {64},
      YEAR = {2002},
     PAGES = {33--49},
      ISSN = {0381-7032},
     CODEN = {ACOMDN},
   MRCLASS = {05C10},
  MRNUMBER = {1914196 (2003e:05037)},
MRREVIEWER = {Bojan Mohar},
}




%  [12] Andrei Gagarin,Wendy Myrvold, and John Chambers. The obstructions
%  for toroidal graphs with no K3,3’s. Discrete Math., 309(11):3625–3631,
%  2009.

@article {nok33,
    AUTHOR = {Gagarin, Andrei and Myrvold, Wendy and Chambers, John},
     TITLE = {The obstructions for toroidal graphs with no {$K_{3,3}$}'s},
   JOURNAL = {Discrete Math.},
  FJOURNAL = {Discrete Mathematics},
    VOLUME = {309},
      YEAR = {2009},
    NUMBER = {11},
     PAGES = {3625--3631},
      ISSN = {0012-365X},
     CODEN = {DSMHA4},
   MRCLASS = {05C10},
  MRNUMBER = {2528075 (2011a:05080)},
MRREVIEWER = {Ken-ichi Kawarabayashi},
       DOI = {10.1016/j.disc.2007.12.075},
       URL = {http://dx.doi.org/10.1016/j.disc.2007.12.075},
}

@article {no_k33_struct,
    AUTHOR = {Gagarin, Andrei and Labelle, Gilbert and Leroux, Pierre},
     TITLE = {The structure of {$K_{3,3}$}-subdivision-free toroidal
              graphs},
   JOURNAL = {Discrete Math.},
  FJOURNAL = {Discrete Mathematics},
    VOLUME = {307},
      YEAR = {2007},
    NUMBER = {23},
     PAGES = {2993--3005},
      ISSN = {0012-365X},
     CODEN = {DSMHA4},
   MRCLASS = {05C10 (05C30)},
  MRNUMBER = {2371071 (2008j:05107)},
MRREVIEWER = {T. R. S. Walsh},
       DOI = {10.1016/j.disc.2007.03.083},
       URL = {http://dx.doi.org/10.1016/j.disc.2007.03.083},
}
	
@article {no_k33_struct_pp,
    AUTHOR = {Gagarin, Andrei and Labelle, Gilbert and Leroux, Pierre},
     TITLE = {The structure and labelled enumeration of {$K_{3,3}$}-subdivision-free projective-planar graphs},
   JOURNAL = {Pure Math. Appl.},
  FJOURNAL = {Pure Mathematics and Applications},
    VOLUME = {16},
      YEAR = {2005},
    NUMBER = {3},
     PAGES = {267--286 (2006)},
      ISSN = {1218-4586},
   MRCLASS = {05C10 (05C30)},
  MRNUMBER = {2272035 (2008f:05046)},
}

%  [13] H. Glover, J. Huneke, and C. Wang. 103 graphs that are irreducible
%  for the projective plane. Journal of Combinatorial Theory Series B,
%  27:332–370, 1979.

@article {ghw,
    AUTHOR = {Glover, Henry H. and Huneke, John P. and Wang, Chin San},
     TITLE = {103 graphs that are irreducible for the projective plane},
   JOURNAL = {J. Combin. Theory Ser. B},
  FJOURNAL = {Journal of Combinatorial Theory. Series B},
    VOLUME = {27},
      YEAR = {1979},
    NUMBER = {3},
     PAGES = {332--370},
      ISSN = {0095-8956},
     CODEN = {JCBTB8},
   MRCLASS = {05C10},
  MRNUMBER = {554298 (81h:05060)},
MRREVIEWER = {Gary Haggard},
       DOI = {10.1016/0095-8956(79)90022-4},
       URL = {http://dx.doi.org/10.1016/0095-8956(79)90022-4},
}
	
@incollection {pp_obs_finite,
    AUTHOR = {Glover, Henry H. and Huneke, J. P.},
     TITLE = {There are finitely many {K}uratowski graphs for the projective
              plane},
 BOOKTITLE = {Graph theory and related topics ({P}roc. {C}onf., {U}niv.
              {W}aterloo, {W}aterloo, {O}nt., 1977)},
     PAGES = {201--206},
 PUBLISHER = {Academic Press, New York-London},
      YEAR = {1979},
   MRCLASS = {05C10},
  MRNUMBER = {538047 (81h:05059)},
MRREVIEWER = {Gary Haggard},
}
	
@incollection {pp_obs,
    AUTHOR = {Glover, Henry H. and Huneke, J. Philip and Wang, Chin San},
     TITLE = {On a {K}uratowski theorem for the projective plane},
 BOOKTITLE = {Graph theory and related topics ({P}roc. {C}onf., {U}niv.
              {W}aterloo, {W}aterloo, {O}nt., 1977)},
     PAGES = {207--218},
 PUBLISHER = {Academic Press, New York-London},
      YEAR = {1979},
   MRCLASS = {05C10},
  MRNUMBER = {538048 (81a:05041)},
MRREVIEWER = {Jonathan L. Gross},
}
		
@article {cubic_pp_obs,
    AUTHOR = {Glover, Henry H. and Huneke, John P.},
     TITLE = {Cubic irreducible graphs for the projective plane},
   JOURNAL = {Discrete Math.},
  FJOURNAL = {Discrete Mathematics},
    VOLUME = {13},
      YEAR = {1975},
    NUMBER = {4},
     PAGES = {341--355},
      ISSN = {0012-365X},
   MRCLASS = {05C99},
  MRNUMBER = {0392684 (52 \#13501)},
}

@article {MR604309,
    AUTHOR = {Decker, R. W. and Glover, H. H. and Huneke, J. P.},
     TITLE = {The genus of the {$2$}-amalgamations of graphs},
   JOURNAL = {J. Graph Theory},
  FJOURNAL = {Journal of Graph Theory},
    VOLUME = {5},
      YEAR = {1981},
    NUMBER = {1},
     PAGES = {95--102},
      ISSN = {0364-9024},
     CODEN = {JGTHDO},
   MRCLASS = {05C10},
  MRNUMBER = {604309 (82d:05056)},
MRREVIEWER = {Saul Stahl},
       DOI = {10.1002/jgt.3190050107},
       URL = {http://dx.doi.org/10.1002/jgt.3190050107},
}
		
@article {MR845136,
    AUTHOR = {Decker, R. W. and Glover, H. H. and Huneke, J. P.},
     TITLE = {Computing the genus of the {$2$}-amalgamations of graphs},
   JOURNAL = {Combinatorica},
  FJOURNAL = {Combinatorica. An International Journal of the J\'anos Bolyai
              Mathematical Society},
    VOLUME = {5},
      YEAR = {1985},
    NUMBER = {4},
     PAGES = {271--282},
      ISSN = {0209-9683},
     CODEN = {COMBDI},
   MRCLASS = {05C10},
  MRNUMBER = {845136 (87f:05054)},
MRREVIEWER = {Saul Stahl},
       DOI = {10.1007/BF02579241},
       URL = {http://dx.doi.org/10.1007/BF02579241},
}
%  [14] J. Hopcroft and R. Tarjan. Efficient planarity testing. J. ACM,
%  21(4):549–568, 1974.

@article {genus:HT,
    AUTHOR = {Hopcroft, John and Tarjan, Robert},
     TITLE = {Efficient planarity testing},
   JOURNAL = {J. Assoc. Comput. Mach.},
  FJOURNAL = {Journal of the Association for Computing Machinery},
    VOLUME = {21},
      YEAR = {1974},
     PAGES = {549--568},
      ISSN = {0004-5411},
   MRCLASS = {68A10 (05C99)},
  MRNUMBER = {0359387 (50 \#11841)},
MRREVIEWER = {D. G. Corneil},
}

		
@article {MR0345442,
    AUTHOR = {Hopcroft, J. E. and Tarjan, R. E.},
     TITLE = {A {$V$} {${\rm log}\ V$} algorithm for isomorphism of
              triconnected planar graphs},
   JOURNAL = {J. Comput. System Sci.},
  FJOURNAL = {Journal of Computer and System Sciences},
    VOLUME = {7},
      YEAR = {1973},
     PAGES = {323--331},
      ISSN = {0022-0000},
   MRCLASS = {68A10 (05C99)},
  MRNUMBER = {0345442 (49 \#10178)},
MRREVIEWER = {Ivan Havel},
}
@article {MR0327391,
    AUTHOR = {Hopcroft, J. E. and Tarjan, R. E.},
     TITLE = {Dividing a graph into triconnected components},
   JOURNAL = {SIAM J. Comput.},
  FJOURNAL = {SIAM Journal on Computing},
    VOLUME = {2},
      YEAR = {1973},
     PAGES = {135--158},
      ISSN = {0097-5397},
   MRCLASS = {94A20 (68A10)},
  MRNUMBER = {0327391 (48 \#5733)},
MRREVIEWER = {W.-K. Chen},
}
@incollection {MR0403302,
    AUTHOR = {Hopcroft, J. E. and Tarjan, R. E.},
     TITLE = {Isomorphism of planar graphs},
 BOOKTITLE = {Complexity of computer computations ({P}roc. {S}ympos., {IBM}
              {T}homas {J}. {W}atson {R}es. {C}enter, {Y}orktown {H}eights,
              {N}. {Y}., 1972)},
     PAGES = {131--152, 187--212},
 PUBLISHER = {Plenum, New York},
      YEAR = {1972},
   MRCLASS = {68A10 (05C10)},
  MRNUMBER = {0403302 (53 \#7114)},
MRREVIEWER = {P. E. O'Neil},
}

@incollection {MR0403301,
    AUTHOR = {Hopcroft, John and Tarjan, Robert},
     TITLE = {Planarity testing in {$V$} log {$V$} steps: extended abstract},
 BOOKTITLE = {Information processing 71 ({P}roc. {IFIP} {C}ongress,
              {L}jubljana, 1971), {V}ol. 1: {F}oundations and systems},
     PAGES = {85--90},
 PUBLISHER = {North-Holland, Amsterdam},
      YEAR = {1972},
   MRCLASS = {68A10},
  MRNUMBER = {0403301 (53 \#7113)},
MRREVIEWER = {A. T. Amin},
}
	
	 

%  [15] M. Juvan. Algorithms and obstructions for embedding graphs in the
%  torus. Ph. D. thesis, University of Ljubljana, 1995. (in Slovene).
@phdthesis{juvan_thesis,
	author="M. Juvan",
	title="Algorithms and obstructions for embedding graphs in the torus" ,
	note="(in Slovene)",
	year="1995",
	school="University of Ljubljana"
}


@article {MR2324271,
    AUTHOR = {Juvan, Martin and Marin{\v{c}}ek, Jo{\v{z}}e and Mohar, Bojan},
     TITLE = {Obstructions for simple embeddings},
   JOURNAL = {Australas. J. Combin.},
  FJOURNAL = {The Australasian Journal of Combinatorics},
    VOLUME = {38},
      YEAR = {2007},
     PAGES = {3--25},
      ISSN = {1034-4942},
   MRCLASS = {05C10 (05C85)},
  MRNUMBER = {2324271 (2008b:05046)},
MRREVIEWER = {Xiaoya Zha},
}

@incollection {MR2581541,
    AUTHOR = {Mohar, Bojan},
     TITLE = {Algorithms and obstructions for embeddings},
 BOOKTITLE = {Topics in topological graph theory},
    SERIES = {Encyclopedia Math. Appl.},
    VOLUME = {128},
     PAGES = {62--80},
 PUBLISHER = {Cambridge Univ. Press, Cambridge},
      YEAR = {2009},
   MRCLASS = {05C10 (05C83 05C85)},
  MRNUMBER = {2581541},
}


@article {MR2116176,
    AUTHOR = {Juvan, Martin and Mohar, Bojan},
     TITLE = {2-restricted extensions of partial embeddings of graphs},
   JOURNAL = {European J. Combin.},
  FJOURNAL = {European Journal of Combinatorics},
    VOLUME = {26},
      YEAR = {2005},
    NUMBER = {3-4},
     PAGES = {339--375},
      ISSN = {0195-6698},
   MRCLASS = {05C10},
  MRNUMBER = {2116176 (2006k:05062)},
MRREVIEWER = {D. S. Archdeacon},
       DOI = {10.1016/j.ejc.2004.02.012},
       URL = {http://dx.doi.org/10.1016/j.ejc.2004.02.012},
}
@article {MR1476749,
    AUTHOR = {Juvan, Martin and Marin{\v{c}}ek, Jo{\v{z}}e and Mohar, Bojan},
     TITLE = {Elimination of local bridges},
      NOTE = {Graph theory (Donovaly, 1994)},
   JOURNAL = {Math. Slovaca},
  FJOURNAL = {Mathematica Slovaca},
    VOLUME = {47},
      YEAR = {1997},
    NUMBER = {1},
     PAGES = {85--92},
      ISSN = {0139-9918},
   MRCLASS = {05C10 (68R10)},
  MRNUMBER = {1476749 (99c:05053)},
MRREVIEWER = {Stanley Gill Williamson},
}

@article {MR1430546,
    AUTHOR = {Juvan, Martin and Mohar, Bojan},
     TITLE = {Obstructions for {$2$}-{M}\"obius band embedding extension
              problem},
   JOURNAL = {SIAM J. Discrete Math.},
  FJOURNAL = {SIAM Journal on Discrete Mathematics},
    VOLUME = {10},
      YEAR = {1997},
    NUMBER = {1},
     PAGES = {57--72},
      ISSN = {0895-4801},
     CODEN = {SJDMEC},
   MRCLASS = {05C10 (68R10)},
  MRNUMBER = {1430546 (98g:05047)},
MRREVIEWER = {V. R. Kulli},
       DOI = {10.1137/S0895480194264150},
       URL = {http://dx.doi.org/10.1137/S0895480194264150},
}

%  [16] M. Juvan, J. Marincek, and B. Mohar. Embedding graphs in the torus
%  in linear time. Lecture Notes in Computer Science, 920:360–363, 1995.

@incollection {mohar1,
    AUTHOR = {Juvan, Martin and Marin{\v{c}}ek, Jo{\v{z}}e and Mohar, Bojan},
     TITLE = {Embedding graphs in the torus in linear time},
 BOOKTITLE = {Integer programming and combinatorial optimization
              ({C}openhagen, 1995)},
    SERIES = {Lecture Notes in Comput. Sci.},
    VOLUME = {920},
     PAGES = {360--363},
 PUBLISHER = {Springer, Berlin},
      YEAR = {1995},
   MRCLASS = {05C85 (05C10)},
  MRNUMBER = {1367994 (96h:05188)},
       DOI = {10.1007/3-540-59408-6_64},
       URL = {http://dx.doi.org/10.1007/3-540-59408-6_64},
}


%  [17] M. Juvan and B. Mohar. A simplified algorithm for embedding graphs
%  in the torus. 2001 preprint. 10 pages.

@unpublished{mohar2,
	author = "M. Juvan and B. Mohar",
	title = "A simplified algorithm for embedding graphs in the torus",
	note = "2001 preprint. 10 pages."
}

%  [18] W. Klotz. A constructive proof of 
% Kuratowski’s theorem. Ars Combinatoria,
%  28:51–54, 1989.

@article {Klotz,
    AUTHOR = {Klotz, W.},
     TITLE = {A constructive proof of {K}uratowski's theorem},
   JOURNAL = {Ars Combin.},
  FJOURNAL = {Ars Combinatoria},
    VOLUME = {28},
      YEAR = {1989},
     PAGES = {51--54},
      ISSN = {0381-7032},
     CODEN = {ACOMDN},
   MRCLASS = {05C10},
  MRNUMBER = {1039130 (91g:05035)},
MRREVIEWER = {Carsten Thomassen},
}
		


%  [19] K. Kuratowski. Sur le probl`eme des courbes gauches en topologie. Fundamenta
%  Mathematicae, 15:271–283, 1930.

@article{kuratowski,
	author="K. Kuratowski",
	title="Sur le probl\`{e}me des courbes gauches en topologie",
	journal="Fundamenta Mathematicae",
	year="1930",
	volume="15",
	pages="271-283"
}

%  [20] B. Mohar and P. Skoda. Obstructions of connectivity 2 for embedding
%  graphs into the torus. 2012 preprint. 31 pages.
@article {mohar_v2cut,
    AUTHOR = {Mohar, Bojan and {\v{S}}koda, Petr},
     TITLE = {Obstructions of connectivity two for embedding graphs into the
              torus},
   JOURNAL = {Canad. J. Math.},
  FJOURNAL = {Canadian Journal of Mathematics. Journal Canadien de
              Math\'ematiques},
    VOLUME = {66},
      YEAR = {2014},
    NUMBER = {6},
     PAGES = {1327--1357},
      ISSN = {0008-414X},
   MRCLASS = {05C10},
  MRNUMBER = {3270786},
MRREVIEWER = {Ga{\v{s}}per Fijav{\v{z}}},
       DOI = {10.4153/CJM-2014-025-x},
       URL = {http://dx.doi.org/10.4153/CJM-2014-025-x},
}
	
@article {MR2881360,
    AUTHOR = {Mohar, Bojan and {\v{S}}koda, Petr},
     TITLE = {Minimizing the number of label transitions around a
              nonseparating vertex of a planar graph},
   JOURNAL = {J. Graph Algorithms Appl.},
  FJOURNAL = {Journal of Graph Algorithms and Applications},
    VOLUME = {16},
      YEAR = {2012},
    NUMBER = {2},
     PAGES = {225--241},
      ISSN = {1526-1719},
   MRCLASS = {05C10 (05C85 68R10)},
  MRNUMBER = {2881360},
MRREVIEWER = {Csaba Bir{\'o}},
       DOI = {10.7155/jgaa.00256},
       URL = {http://dx.doi.org/10.7155/jgaa.00256},
}
@incollection {MR2930985,
    AUTHOR = {Mohar, Bojan and {\v{S}}koda, Petr},
     TITLE = {On minimizing the number of label transitions around a vertex
              of a planar graph},
 BOOKTITLE = {Combinatorial algorithms},
    SERIES = {Lecture Notes in Comput. Sci.},
    VOLUME = {7056},
     PAGES = {300--309},
 PUBLISHER = {Springer, Heidelberg},
      YEAR = {2011},
   MRCLASS = {05C10 (05C85)},
  MRNUMBER = {2930985},
       DOI = {10.1007/978-3-642-25011-8_24},
       URL = {http://dx.doi.org/10.1007/978-3-642-25011-8_24},
}

%  [21] Bojan Mohar and Carsten Thomassen. Graphs on surfaces. Johns Hopkins
%  Studies in the Mathematical Sciences. Johns Hopkins University
%  Press, Baltimore, MD, 2001.
%  20

@book {gos,
    AUTHOR = {Mohar, Bojan and Thomassen, Carsten},
     TITLE = {Graphs on surfaces},
    SERIES = {Johns Hopkins Studies in the Mathematical Sciences},
 PUBLISHER = {Johns Hopkins University Press, Baltimore, MD},
      YEAR = {2001},
     PAGES = {xii+291},
      ISBN = {0-8018-6689-8},
   MRCLASS = {05C10 (57M15)},
  MRNUMBER = {1844449 (2002e:05050)},
MRREVIEWER = {Arthur T. White},
}
	
%  [22] Wendy Myrvold and William Kocay. Errors in graph embedding algorithms.
%  J. Comput. System Sci., 77(2):430–438, 2011.

@article {myrvoldfilotti,
    AUTHOR = {Myrvold, Wendy and Kocay, William},
     TITLE = {Errors in graph embedding algorithms},
   JOURNAL = {J. Comput. System Sci.},
  FJOURNAL = {Journal of Computer and System Sciences},
    VOLUME = {77},
      YEAR = {2011},
    NUMBER = {2},
     PAGES = {430--438},
      ISSN = {0022-0000},
     CODEN = {JCSSBM},
   MRCLASS = {05C85 (05C10)},
  MRNUMBER = {2780138 (2012f:05298)},
MRREVIEWER = {Bharati Rajan},
       DOI = {10.1016/j.jcss.2010.06.002},
       URL = {http://dx.doi.org/10.1016/j.jcss.2010.06.002},
}
				 

%  [23] E. Neufeld. Practical toroidality testing. Master’s thesis, Department
%  of Computer Science, University of Victoria, Victoria, B.C., 1993.

@mastersthesis{neufeldthesis,
	author="E. Neufeld",
	title="Practical toroidality testing",
	institution = UVic,
	school=UVic,
	address = UVicAddress,
	year="1993"
}



%  [24] E. Neufeld andW. Myrvold. Practical toroidality testing. In Proceedings
%  of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
%  pages 574–580, 1997.

@inproceedings {neufeldmyrvold,
    AUTHOR = {Neufeld, Eugene and Myrvold, Wendy},
     TITLE = {Practical toroidality testing},
 BOOKTITLE = {Proceedings of the {E}ighth {A}nnual {ACM}-{SIAM} {S}ymposium
              on {D}iscrete {A}lgorithms ({N}ew {O}rleans, {LA}, 1997)},
     PAGES = {574--580},
 PUBLISHER = {ACM, New York},
      YEAR = {1997},
   MRCLASS = {05C10 (05C85)},
  MRNUMBER = {1447705},
}

%  [25] N. Robertson and P. Seymour. Graph minors. VIII. a Kuratowski theorem
%  for general surfaces. Journal of Combinatorial Theory. Series B,
%  48:255–288, 1990.

@article {robertsonseymour,
    AUTHOR = {Robertson, Neil and Seymour, P. D.},
     TITLE = {Graph minors. {VIII}.\ {A} {K}uratowski theorem for general
              surfaces},
   JOURNAL = {J. Combin. Theory Ser. B},
  FJOURNAL = {Journal of Combinatorial Theory. Series B},
    VOLUME = {48},
      YEAR = {1990},
    NUMBER = {2},
     PAGES = {255--288},
      ISSN = {0095-8956},
     CODEN = {JCBTB8},
   MRCLASS = {05C10},
  MRNUMBER = {1046758 (91g:05040)},
MRREVIEWER = {D. S. Archdeacon},
       DOI = {10.1016/0095-8956(90)90121-F},
       URL = {http://dx.doi.org/10.1016/0095-8956(90)90121-F},
}


%  [26] K. Wagner. ¨Uber einer eigenschaft der ebener complexe. Mathematische
%  Annalen, 114:570–590, 1937.


@ARTICLE{Wagner,
   AUTHOR = "K. Wagner",
   TITLE = {\"{U}ber Einer Eigenschaft der Ebener Complexe},
   JOURNAL = "Mathematische Annalen",
   YEAR = "1937",
   VOLUME = "114",
   PAGES = "570--590"
}

%  [27] Douglas B.West. Introduction to graph theory. Prentice Hall Inc., Upper
%  Saddle River, NJ, 1996.

@book {intro1,
    AUTHOR = {West, Douglas B.},
     TITLE = {Introduction to graph theory},
 PUBLISHER = {Prentice Hall, Inc., Upper Saddle River, NJ},
      YEAR = {1996},
     PAGES = {xvi+512},
      ISBN = {0-13-227828-6},
   MRCLASS = {05-01},
  MRNUMBER = {1367739 (96i:05001)},
}
		


%  [28] S. G. Williamson. Embedding graphs in the plane- algorithmic aspects.
%  Annals of Discrete Mathematics, 6:349–384, 1980.

@article {will:planar,
    AUTHOR = {Williamson, S. G.},
     TITLE = {Embedding graphs in the plane---algorithmic aspects},
      NOTE = {Combinatorial mathematics, optimal designs and their
              applications (Proc. Sympos. Combin. Math. and Optimal Design,
              Colorado State Univ., Fort Collins, Colo., 1978)},
   JOURNAL = {Ann. Discrete Math.},
  FJOURNAL = {Annals of Discrete Mathematics},
    VOLUME = {6},
      YEAR = {1980},
     PAGES = {349--384},
   MRCLASS = {68C05 (05C10 68E10)},
  MRNUMBER = {593547 (83c:68036)},
}


%  [29] S. G.Williamson. Depth-first search and Kuratowski subgraphs. Journal
%  of the ACM, 31(4):681–693, 1984.

@article {will:obs,
    AUTHOR = {Williamson, S. G.},
     TITLE = {Depth-first search and {K}uratowski subgraphs},
   JOURNAL = {J. Assoc. Comput. Mach.},
  FJOURNAL = {Journal of the Association for Computing Machinery},
    VOLUME = {31},
      YEAR = {1984},
    NUMBER = {4},
     PAGES = {681--693},
      ISSN = {0004-5411},
     CODEN = {JACOAH},
   MRCLASS = {68Q25 (05C10 68R10)},
  MRNUMBER = {819162},
       DOI = {10.1145/1634.322451},
       URL = {http://dx.doi.org/10.1145/1634.322451},
}
		     

@article {will:compare,
    AUTHOR = {Canfield, E. R. and Williamson, S. G.},
     TITLE = {The two basic linear time planarity algorithms: are they the
              same?},
   JOURNAL = {Linear and Multilinear Algebra},
  FJOURNAL = {Linear and Multilinear Algebra},
    VOLUME = {26},
      YEAR = {1990},
    NUMBER = {4},
     PAGES = {243--265},
      ISSN = {0308-1087},
     CODEN = {LNMLAZ},
   MRCLASS = {05C10 (68Q25)},
  MRNUMBER = {1042701 (91d:05042)},
MRREVIEWER = {Mirko K{\v{r}}iv{\'a}nek},
       DOI = {10.1080/03081089008817982},
       URL = {http://dx.doi.org/10.1080/03081089008817982},
}
		     


%  [30] J. Woodcock. A faster algorithm for torus embedding. Master’s thesis,
%  Department of Computer Science, University of Victoria, Victoria, B.C.,
%  2004.

@mastersthesis{jrwthesis,
        title = "A Faster Algorithm for Torus Embedding",
        author = "J. Woodcock",
        institution = UVic,
        school = UVic,
        address = UVicAddress,
        note="Available from http://dspace.library.uvic.ca:8080/handle/1828/130",
        year = 2004
}

