In this paper we develop the technique of a distribution decomposition for a
graph. A formula is given to determine genus distribution of a cubic graph. Given any connected graph, it is proved that its genus distribution is the sum of those for some cubic graphs by using the technique

Hong-Jian Lai

Liangxia Wan

Yanpei Liu

ZENODO

English

A combinatorial representtion for polyhedral surfaces,

Advances in Combinatorial Maps (in Chinese),

Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem,

Embeddability in Graphs,

Genus distribution for ladder type and cross type graphs,

Genus distribution of general ladders (in Chinese),

Genus distribution of Ringel ladders,

Genus distribution of the orientable embeddings for a type of new graphs (in chinese),

Genus distributions for bouquets of circles,

Genus distributions for two classes of graphs,

Hierarcy of imbedding distribution invariants of a graph,

Minimal imbeddings and the genus of a graph,

On embedding genus distribution of ladders and crosses,

Orientable embedding distributions by genus for certain type of nonplanar graphs

Orientable embedding distributions by genus for certain type of nonplanar graphs (II), accepted by Ars Combin..

Orientable embedding genus distribution for certain types of graphs,

The genus, regional number, and Betti number of a graph,

The graph genus problem is NP-complete,

Genus Distribution for a Graph