ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｒｅａｒｅｍａｎｙｓｔｒｕｃｔｕｒｅｓｉｎｅｎｇｉｎｅｅｒｉｎｇ，ｗｈｉｃｈａｒｅｎｏｔａｘｉ＿ｓｙｍｍｅｔｒｉｃ，ｂｕｔｃｙｃｌｉｃａｌｌｙｓｙｍｍｅｔｒｉｃ，ｏｒｃａｌｌｅｄｒｏｔａｔｉｏｎａｌｌｙｐｅｒｉｏｄｉｃ，.........

Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Proce......

A proper edge t-coloring of a graph G is a coloring of its edges with colors 1,2,???,t such that all colors are used, an......

A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obt......

In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially co......

A total coloring of a graph G with colors 1, 2, ..., t is called a cyclically interval total t-coloring if all colors ar......