Destroying Noncomplete Regular Components in Graph Partitions |
| |
Authors: | Landon Rabern |
| |
Institution: | School of Mathematical and Statistical Sciences, Arizona State University |
| |
Abstract: | We prove that if G is a graph and such that then can be partitioned into sets such that and contains no noncomplete ‐regular components for each . In particular, the vertex set of any graph G can be partitioned into sets, each of which induces a disjoint union of triangles and paths. |
| |
Keywords: | partition coloring triangle |
|
|