arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.02799math.COcs.DM
收藏

关于含有轻边或交错2-圈的图的边划分的一个注记

A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle

Xin Zhang, Bei Niu

摘要:

设$\mathcal{G}_α$是一个遗传图类(即$G_α\in \mathcal{G}_α$的每个子图都属于$\mathcal{G}_α$),使得$\mathcal{G}_α$中的每个图$G_α$的最小度至多为1,或者包含一个边$uv$使得$d_{G_α}(u)+d_{G_α}(v)\leq α$或一个2-交错圈.证明了$\mathcal{G}_α$($α\geq 5$)中具有最大度$Δ$的图都可以边划分为两个森林$F_1$,$F_2$和一个子图$H$,使得对于$i=1,2$和$Δ(H)\leq α-5$,有$Δ(F_i)\leq \max\{2,\lceil\frac{Δ-α+6}{2}\rceil\}$.

英文摘要:

Let $\mathcal{G}_α$ be a hereditary graph class (i.e, every subgraph of $G_α\in \mathcal{G}_α$ belongs to $\mathcal{G}_α$) such that every graph $G_α$ in $\mathcal{G}_α$ has minimum degree at most 1, or contains either an edge $uv$ such that $d_{G_α}(u)+d_{G_α}(v)\leq α$ or a 2-alternating cycle. It is proved that every graph in $\mathcal{G}_α$ ($α\geq 5$) with maximum degree $Δ$ can be edge-partitioned into two forests $F_1$, $F_2$ and a subgraph $H$ such that $Δ(F_i)\leq \max\{2,\lceil\frac{Δ-α+6}{2}\rceil\}$ for $i=1,2$ and $Δ(H)\leq α-5$.

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

↑