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

TL;DR

This paper studies a specific class of graphs with certain degree and cycle properties, demonstrating they can be edge-partitioned into two forests and a subgraph with bounded degrees.

Contribution

It proves that graphs in this class with maximum degree Δ can be partitioned into two forests and a subgraph with explicit degree bounds, extending understanding of graph decompositions.

Findings

Graphs with the specified properties can be decomposed into two forests and a subgraph.

Degree bounds for the forests and subgraph are explicitly characterized.

The results apply to graphs with minimum degree at most 1 or containing an edge with low degree sum or an alternating cycle.

Abstract

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