Genus Distributions for Iterated Claws

Electronic Journal Of Combinatorics

Jonathan L. Gross¹ 

关键词: Graph theory;    genus distribution;    graph embedding;    partitioned genus distribution.;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We derive a recursion for the genus distributions of the graphs obtained by iteratively attaching a claw to the dipole $D_3$. The minimum genus of the graphs in this sequence grows arbitrarily large. The families of graphs whose genus distributions have b

【 授权许可】

Others