Destroying Non-Complete Regular Components in Graph Partitions

Details Destroying Non-Complete Regular Components in Graph Partitions Destroying Non-Complete Regular Components in Graph Partitions

2011-02-06

arxiv.org/abs/1102.1169v1

Mathematics

Combinatorics

Scientific paper

We prove that if $G$ is a graph and $r_1, ..., r_k \in \mathbb{Z}_{\geq 0}$ such that $\sum_{i=1}^k r_i \geq \Delta(G) + 2 - k$ then $V(G)$ can be partitioned into sets $V_1, ..., V_k$ such that $\Delta(G[V_i]) \leq r_i$ and $G[V_i]$ contains no non-complete $r_i$-regular components for each $1 \leq i \leq k$. In particular, the vertex set of any graph $G$ can be partitioned into $\left \lceil \frac{\Delta(G) + 2}{3} \right \rceil$ sets, each of which induces a disjoint union of triangles and paths.

Affiliated with

Also associated with

No associations

Rating

Destroying Non-Complete Regular Components in Graph Partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Destroying Non-Complete Regular Components in Graph Partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Destroying Non-Complete Regular Components in Graph Partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506374