Skip to content
Little GolemMake your next move.

Search for small alternating planar graphs

Public forum discussion.

General

#151 · FatPhil

11 Feb 2013

nope, how massive was the computer effort?

#152 · Ingo Althofer

11 Feb 2013

I see.

From a mail by Gunnar Brinkmann:
> For 17 nodes 18,927,037,827,561 graphs were tested. It took about 214 CPU days.

Ingo.

PS: Gunnar Brinkmann asked me to call his graph not Brinkmann-17, but
Gent-17. (He is at Gent University.) So I did.

#153 · Hjallti

17 Feb 2013

If I read this I am really sad I have up my request when I was in third year of my university, when I wanted to make my Master-thesis in Graph-theory, but the prof in Louvain for some reason kept me waiting... should have changed university and gone to Gent that year...
I got my PhD but I would have been much more interested and capable in research in this area I think... :-(

#154 · Ingo Althofer

13 Sep 2013

Hello, some news. Based on the fact that one
discoverer of a 17-vertex-apg is Frank Schneider
("Schneider" is German and means "taylor") and that
Ghent (the city behind apg Gent-17) was/is famous
for manufacturing and dealing with broadcloth, I
designed a new board game "Schneider von Gent".
The game board is either Schneider-17 or Gent-17.

Rules and pictures of a prototype can be found
here.

Ingo.

PS: The design is already from March 2013. However, it took
me a while to set up the website.

#155 · Ingo Althofer

30 May 2015

Hello everybody,

in some cases time is dropping slowly. Finally, a paper has been published in

"ARS MATHEMATICA CONTEMPORANEA", Volume 8 (2015).

Title is "Alternating Plane Graphs".

Authors are Jan Kristian Haugland (Norway, Karl Scherer (New Zealand), Frank Schneider (Germany),

Nico van Cleemput (Belgium), and me. The paper includes some ideas from other participants in this

thread. These participants are mentioned in the acknowledgements.

The paper (pdf with 27 pages) is freely available at

this place.

Cheers, Ingo.

Last page