YE Jian-hua
Abstract
Vertex-distinguishing-equitable total coloring(VDETC) of some mycielski graphs was studied,and obtained the vertex-distinguishing-equitable total chromatic numbers of mycielski graphs of path,cycle,star and fan by using constructive method,which satisfy the conjecture on VDETC.
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.
Vertex-distinguishing-equitable total coloring(VDETC) of some mycielski graphs was studied,and obtained the vertex-distinguishing-equitable total chromatic numbers of mycielski graphs of path,cycle,star and fan by using constructive method,which satisfy the conjecture on VDETC.
Key concepts: Combinatorics, Vertex (graph theory), Conjecture, Brooks' theorem, Mathematics, Constructive, Complete coloring, Fractional coloring