CAJ | 학술논문

研究了超图的conflict-free着色问题。利用矩阵半张量积方法给出了conflict-free着色的两个充要条件，建立了一个可以确定出所有conflict-free着色方案的新算法。把结果应用于频率分配问题，说明了理论结果的有效性和应用性。
연구료초도적conflict-free착색문제。이용구진반장량적방법급출료conflict-free착색적량개충요조건，건립료일개가이학정출소유conflict-free착색방안적신산법。파결과응용우빈솔분배문제，설명료이론결과적유효성화응용성。
The conflict-free coloring problem of hypergraphs was investigated,and some new results and algorithms were obtained.Using the semi-tensor product method,two necessary and sufficient conditions were proposed for the conflict-free coloring problem based on which a new algorithm was established to find all the conflict-free coloring schemes for any hypergraph.Then the theoretical results were applied to the frequency assignment problem to show its effectiveness and applicability.