张忠辅, 孙良
Abstract
Let G(V, E) be a simple graph, f: C→V(G) be an injection, and all vertices on the path whose length is no longer than n be assigned different colors, where C is a color set. Then f is called an n-coloring of G. If |C|=m, f is called m-n-coloring graph, G m-n-colorable if there exists a k-n-coloring of G for some k≤m.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G(V, E) be a simple graph, f: C→V(G) be an injection, and all vertices on the path whose length is no longer than n be assigned different colors, where C is a color set. Then f is called an n-coloring of G. If |C|=m, f is called m-n-coloring graph, G m-n-colorable if there exists a k-n-coloring of G for some k≤m.
Key concepts: Combinatorics, Mathematics, Fractional coloring, Graph, Graph power, Edge coloring, Discrete mathematics, Bound graph