Skip to main content
Changed some wording to clean it up and added a link to the C++ Boost implementation
Source Link

Is there a standard test for the recognition of toroidal graphs?

I I have been using the Boyer-Myrvold planarity algorithm (which, which has a MATLAB and C++ implementation), and I would like to know if there is something similar for toroidal graphs.

Is there a standard test for the recognition of toroidal graphs?

I have been using the Boyer-Myrvold algorithm (which has a MATLAB implementation) and would like to know if there is something similar for toroidal graphs.

Is there a standard test for the recognition of toroidal graphs? I have been using the Boyer-Myrvold planarity algorithm, which has a MATLAB and C++ implementation, and I would like to know if there is something similar for toroidal graphs.

Source Link
Felix Goldberg
  • 7k
  • 4
  • 31
  • 55

Toroidality testing

Is there a standard test for the recognition of toroidal graphs?

I have been using the Boyer-Myrvold algorithm (which has a MATLAB implementation) and would like to know if there is something similar for toroidal graphs.