Tag Archives: Graph isomorphism

Four color theorem: simplified maps and fullerenes


Analyzing all 3-regular graphs that have only faces with 5 edges or more (simplified), I empirically found (using a computer program) that many hypothetically possible graphs, that by Euler’s identity may exist (), do not actually exist. Using a VF2 algorithm to filter out … Continue reading

Posted in math | Tagged , , , , | 1 Comment