arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.08689math.CO
收藏

关于图的特殊因子

On specific factors in graphs

Csilla Bujtás, Stanislav Jendrol, Zsolt Tuza

摘要:

众所周知,如果$G = (V, E)$ }是一个多重图,并且$X\subset V$是偶数阶的子集,则$G$包含一个生成森林$H$,使得来自$X$的每个顶点在$H$中具有奇数度,并且所有其他顶点在$H$中具有偶数度。这个生成森林可能有孤立的顶点。如果这在$H$中是不允许的,那么情况就复杂得多。本文对这一问题进行了研究,并将偶因子和奇因子的概念统一推广。

英文摘要:

It is well known that if $G = (V, E)$} is a multigraph and $X\subset V$ is a subset of even order, then $G$ contains a spanning forest $H$ such that each vertex from $X$ has an odd degree in $H$ and all the other vertices have an even degree in $H$. This spanning forest may have isolated vertices. If this is not allowed in $H$, then the situation is much more complicated. In this paper, we study this problem and generalize the concepts of even-factors and odd-factors in a unified form.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑