本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2020
摘要
We introduce the concept of complete edge-colored per突變 graphs as complete graphs that are the edge-disjoint union of “classical” per突變 graphs. We show that a graph G = (V,E) is a com- plete edge-colored per突變 graph if and only if each monochromatic subgraph of G is a “classical” per突變 graph and G does not contain a triangle with 3 different colors. Using the modular decomposition as a framework we demonstrate that complete edge-colored per突變 graphs are characterized in terms of their strong prime modules, which induce also complete edge-colored per突變 graphs. This leads to an O(|V |2)-time recognition algorithm. We show, moreover, that complete edge-colored per突變 graphs form a superclass of so-called symbolic ultrametrics and that the coloring of such graphs is always a Gallai coloring.
※ 此為已發表論文，全文需透過期刊付費取得