图的顶点着色或寻找Meyniel阻塞
Coloring vertices of a graph or finding a Meyniel obstruction
摘要：
Meyniel障碍物是一个奇数循环，至少有五个顶点，最多一个弦。一个图是Meyniel当且仅当它没有Meyniel阻塞作为导出子图。这里我们给出了一个O（n^2）算法，对于任何图，找到一个相同大小的团和着色或Meyniel阻塞。我们还给出了一个O（n^3）算法，对于任何图，找到一个容易识别的强稳定集或Meyniel阻塞。
英文摘要：
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds either a clique and coloring of the same size or a Meyniel obstruction. We also give a O(n^3) algorithm that, for any graph, finds either aneasily recognizable strong stable set or a Meyniel obstruction.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
