Kindai University · Faculty of Engineering

Research keywordsgraph embeddings・Euclidean 3-space・edge-colored complete graphs・hypergraph enumeration・self-complementary graphs

This is a public-data preview. Personalized fit, contact angles, and saved workflows require sign-in.

• A circular embedding of graphs in Euclidean 3-space
• Rooted tree polylogarithms
• Edge colored complete graphs and generalization of self-complementarity
• Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected

• Official profile