Irreducibility of the Tutte polynomial of an embedded graph

Algebraic Combinatorics(2022)

引用 0|浏览7
暂无评分
摘要
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that the Tutte polynomial of a graph is irreducible if and only if the graph is connected and non-separable.
更多
查看译文
关键词
tutte polynomial,irreducibility,graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要