Partitions of a graph into paths with prescribed endvertices and lengths

Hikoe Enomoto, Katsuhiro Ota

Research output: Contribution to journalArticle

10 Citations (Scopus)


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 = Σki=1 ai and σ2(G) ≥ n+k - 1, then for any k vertices v1, v2, . . . , vk in G, there exist vertex-disjoint paths P1, P2, . . ., Pk such that

Original languageEnglish
Pages (from-to)163-169
Number of pages7
JournalJournal of Graph Theory
Issue number2
Publication statusPublished - 2000 Jun


ASJC Scopus subject areas

  • Geometry and Topology

Cite this