  
  
  [1XReferences[101X
  
  [[20XBM04[120X] [16XBoyer, J. M. and Myrvold, W. J.[116X, [17XOn the Cutting Edge: Simplified O(n)
  Planarity by Edge Addition[117X, [18XJournal of Graph Algorithms and Applications[118X, [19X8[119X,
  3 (2004), 241--273.
  
  [[20XBM06[120X] [16XBoyer, J. M. and Myrvold, W. J.[116X, [17XOn the Cutting Edge: Simplified O(n)
  Planarity  by Edge Addition[117X, in Graph Algorithms and Applications 5, {WORLD}
  {SCIENTIFIC} (2006), 241--273.
  
  [[20XBoy06[120X]  [16XBoyer, J. M.[116X ([1m[31mHealy, P. and Nikolov, N. S.[15X, Eds.), [17XA New Method for
  Efficiently  Generating  Planar  Graph  Visibility Representations[117X, in Graph
  Drawing, Springer Berlin Heidelberg, Berlin, Heidelberg (2006), 508--511.
  
  [[20XBoy12[120X] [16XBoyer, J. M.[116X, [17XSubgraph Homeomorphism via the Edge Addition Planarity
  Algorithm[117X,  [18XJournal  of  Graph  Algorithms  and  Applications[118X, [19X16[119X, 2 (2012),
  381--410.
  
  [[20XBys02[120X]  [16XByskov,  J.[116X,  [17XChromatic  Number  in Time O(2.4023 n ) Using Maximal
  Independent Sets[117X, [18XBRICS Report Series[118X, [19X9[119X (2002), .
  
  [[20XCK86[120X]  [16XCalderbank,  R. and Kantor, W. M.[116X, [17XThe geometry of two-weight codes[117X,
  [18XBull. London Math. Soc.[118X, [19X18[119X, 2 (1986), 97--122.
  
  [[20XGab00[120X]   [16XGabow,  H.  N.[116X,  [17XPath-based  depth-first  search  for  strong  and
  biconnected components[117X, [18XInformation Processing Letters[118X, [19X74[119X, 34 (2000), 107 -
  114.
  
  [[20XJK07[120X] [16XJunttila, T. and Kaski, P.[116X ([1m[31mApplegate, D., Brodal, G. S., Panario, D.
  and  Sedgewick,  R.[15X, Eds.), [17XEngineering an efficient canonical labeling tool
  for  large  and  sparse  graphs[117X,  in  Proceedings  of  the Ninth Workshop on
  Algorithm  Engineering  and  Experiments and the Fourth Workshop on Analytic
  Algorithms and Combinatorics, SIAM (2007), 135--149.
  
  [[20XLaw76[120X]  [16XLawler,  E.[116X,  [17XA  Note  on  the  Complexity  of the Chromatic Number
  Problem[117X, [18XInf. Process. Lett.[118X, [19X5[119X (1976), 66-67.
  
  [[20XLT79[120X]  [16XLengauer,  T.  and  Tarjan,  R.  E.[116X,  [17XA  Fast  Algorithm for Finding
  Dominators  in  a  Flowgraph[117X,  [18XACM Transactions on Programming Languages and
  Systems[118X, [19X1[119X, 1 (1979), 121--141.
  
  [[20XMP14[120X]  [16XMcKay,  B.  D.  and  Piperno,  A.[116X,  [17XPractical graph isomorphism, II[117X,
  [18XJournal of Symbolic Computation[118X, [19X60[119X, 0 (2014), 94 - 112.
  
  [[20XvLS81[120X]  [16Xvan Lint, J. H. and Schrijver, A.[116X, [17XConstruction of strongly regular
  graphs,   two-weight   codes   and  partial  geometries  by  finite  fields[117X,
  [18XCombinatorica[118X, [19X1[119X, 1 (1981), 63--73.
  
  
  
  [32X
