论文标题
图形最小化，重点介绍了平面中5个晶状体距离图的示例
Graph minimization, focusing on the example of 5-chromatic unit-distance graphs in the plane
论文作者
论文摘要
我们介绍了一种新的图形最小化方法，其中需要保留某些图形属性，并且有一个有效的过程来检查此属性。我们应用了此方法来最大程度地减少5个晶状体距离图，并获得了具有509个顶点和2442个边缘的图。
We introduce a new graph minimization method, in which it is required to preserve some graph property and there is an effective procedure for checking this property. We applied this method to minimize 5-chromatic unit-distance graphs and obtained a graph with 509 vertices and 2442 edges.
