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.
On the Relation Between Two Minor-Monotone Graph Parameters
β Scribed by R. Pendavingh
- Publisher
- Springer-Verlag
- Year
- 1998
- Tongue
- English
- Weight
- 198 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For an undirected graph G = (V,E) let i'(G) be the largest d for which there exists an oriented matroid M on V of corank d such that for each nonzero vector (x+,x-) of M, x+ is nonempty and induces a connected subgraph of G. We show that I'(G) is monotone under taking minors and clique sums. Moreov
This paper deals with certain edge labelings of graphs. After having introduced the concepts of a weak antimagic graph and an Egyptian magic graph, the authors showed that every connected graph of order 23 is weakly antimagic and proved some interesting relations between the different edge labelings