### Abstract

For a graph G, let σ_{2}(G) denote the minimum degree sum of a pair of nonadjacent vertices. We conjecture that if |V(G)| = n = Σ^{k}_{i=1} a_{i} and σ_{2}(G) ≥ n+k - 1, then for any k vertices v_{1}, v_{2}, . . . , v_{k} in G, there exist vertex-disjoint paths P_{1}, P_{2}, . . ., P_{k} such that

Original language | English |
---|---|

Pages (from-to) | 163-169 |

Number of pages | 7 |

Journal | Journal of Graph Theory |

Volume | 34 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2000 Jun |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology