关于三次图的正规奇分拆
On normal odd partitions in cubic graphs
摘要:
一个三次图的边的正规划分是一个划分为迹(没有重复的边)的划分,使得每个顶点恰好是该划分的一个迹的端点。我们研究了这一概念,并给出了一些结果和问题。
英文摘要:
A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。