Graph minors and linkages

@article{Chen2005GraphMA,
  title={Graph minors and linkages},
  author={Guantao Chen and Ronald J. Gould and Ken-ichi Kawarabayashi and Florian Pfender and Bing Wei},
  journal={Journal of Graph Theory},
  year={2005},
  volume={49},
  pages={75-91}
}
Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense graph minor. In this paper we investigate the ties between small graph minors and linkages. In particular, we show that a 6-connected graph with a K− 9 minor is 3-linked. Further, we show that a 7-connected graph with a K− 9 minor is (2, 5)-linked. Finally, we show that a graph of order n and size at least 7n − 29 contains a K−− 9 minor. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Homomorphiesätze für Graphen

  • W. Mader
  • Math Ann
  • 1968
Highly Influential
4 Excerpts

On certain homomorphism properties of graphs II

  • I. T. Jakobsen
  • Math Scand. 52(1983),
  • 1983
1 Excerpt

Covering three edges with a bond in a nonseparable graph (Abstract)

  • N. Robertson, K Chakravarti
  • in Combinatorics,
  • 1979
1 Excerpt

On the existence of certain configurations within graphs and the 1-skeleons of polytopes

  • D. G. Larman, P. Mani
  • Proc. Londo Math. Soc
  • 1974
2 Excerpts

Similar Papers

Loading similar papers…