✦ LIBER ✦

On vertex partitions and some minor-monotone graph parameters

✍ Scribed by D. Gonçalves

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 107 KB
Volume: 66
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20490

No coin nor oath required. For personal study only.

✦ Synopsis

We study vertex partitions of graphs according to some minormonotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters are such that, any graph G with (G) ≥ 2 admits a vertex partition into two graphs with parameter at most (G)-1. Here we prove that some of these parameters are such that, any graph G with (G) ≥ 3 admits a vertex partition into three graphs with parameter at most (G)-2. ᭧ 2010 Wiley

📜 SIMILAR VOLUMES

Some remarks on Arc-connectivity, vertex

Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs

✍ Bill Jackson 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio