Perfect Colorings

摘要

A problem that arises when the segmentation of a file in a network is consideredwithout redundancy is studied. This problem translates to a graph coloring problem: k colorability. Several basic results for perfectly k colorable graphs are proved. It is shown how to generate all perfectly k colorable graphs, and some simple classes of perfectly k colorable graphs are characterized. On the