Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
