Partitions of a graph into paths with prescribed endvertices and lengths

Hikoe Enomoto, Katsuhiro Ota

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 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
Volume34
Issue number2
Publication statusPublished - 2000 Jun

Fingerprint

Degree Sum
Disjoint Paths
Minimum Degree
Partition
Denote
Path
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Partitions of a graph into paths with prescribed endvertices and lengths. / Enomoto, Hikoe; Ota, Katsuhiro.

In: Journal of Graph Theory, Vol. 34, No. 2, 06.2000, p. 163-169.

Research output: Contribution to journalArticle

@article{75242bd0289e47e7b371d456d9bac0c6,
title = "Partitions of a graph into paths with prescribed endvertices and lengths",
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 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",
author = "Hikoe Enomoto and Katsuhiro Ota",
year = "2000",
month = "6",
language = "English",
volume = "34",
pages = "163--169",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Partitions of a graph into paths with prescribed endvertices and lengths

AU - Enomoto, Hikoe

AU - Ota, Katsuhiro

PY - 2000/6

Y1 - 2000/6

N2 - 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 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

AB - 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 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

UR - http://www.scopus.com/inward/record.url?scp=0034197810&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034197810&partnerID=8YFLogxK

M3 - Article

VL - 34

SP - 163

EP - 169

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -