| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652883 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
We study vertex partitions of graphs according to their Colin de Verdiere parameter μ. By a result of Ding et al. [DOSOO] we know that any graph G with μ(G)⩾2 admits a vertex partition into two graphs with μ at most μ(G)−1. Here we prove that any graph G with μ(G)⩾3 admits a vertex partition into three graphs with μ at most μ(G)−2. This study is extended to other minor-monotone graph parameters like the Hadwiger number.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
