Relationships between the length of a longest path and the relative length

Shuya Chiba, Ryota Matsubara, Masao Tsugaki

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Let G be a graph, and let p(G) and c(G) be the order of a longest path and a longest cycle of G, respectively. In [J. Graph Theory 30 (1999), 91-99], Saito proved that if G is a 2-connected graph with p(G) - c(G) ≥ 2, then p(G) ≥ σ 3(G) - 1. In this paper, we evaluate the length of a longest path of G by using σ 4(G). Specifically, our main results are the following. (i) If G is a 3-connected graph with p(G) - c(G) ≥ 3, then p(G) ≥ σ 4(G)-5, and (ii) if G is a 3-connected graph withp(G)-c(G) ≥ 2, then p(G) ≥ 3σ 4(G)/4-1. The statement (ii) is a generalization of Saito's theorem for 3-connected graphs. In fact, we characterize all graphs G with p(G) - c(G) ≥ 2 and p(G) = 3σ 4(G)/4-1. Following these results, we propose a conjecture, and obtain an application for the problem concerning the existence of vertex-disjoint paths.

Original languageEnglish
Pages (from-to)91-107
Number of pages17
JournalAustralasian Journal of Combinatorics
Volume47
Publication statusPublished - 2010
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Relationships between the length of a longest path and the relative length. / Chiba, Shuya; Matsubara, Ryota; Tsugaki, Masao.

In: Australasian Journal of Combinatorics, Vol. 47, 2010, p. 91-107.

Research output: Contribution to journalArticle

@article{16d03e4887d2401fb4a79bef8d628c5c,
title = "Relationships between the length of a longest path and the relative length",
abstract = "Let G be a graph, and let p(G) and c(G) be the order of a longest path and a longest cycle of G, respectively. In [J. Graph Theory 30 (1999), 91-99], Saito proved that if G is a 2-connected graph with p(G) - c(G) ≥ 2, then p(G) ≥ σ 3(G) - 1. In this paper, we evaluate the length of a longest path of G by using σ 4(G). Specifically, our main results are the following. (i) If G is a 3-connected graph with p(G) - c(G) ≥ 3, then p(G) ≥ σ 4(G)-5, and (ii) if G is a 3-connected graph withp(G)-c(G) ≥ 2, then p(G) ≥ 3σ 4(G)/4-1. The statement (ii) is a generalization of Saito's theorem for 3-connected graphs. In fact, we characterize all graphs G with p(G) - c(G) ≥ 2 and p(G) = 3σ 4(G)/4-1. Following these results, we propose a conjecture, and obtain an application for the problem concerning the existence of vertex-disjoint paths.",
author = "Shuya Chiba and Ryota Matsubara and Masao Tsugaki",
year = "2010",
language = "English",
volume = "47",
pages = "91--107",
journal = "Australasian Journal of Combinatorics",
issn = "1034-4942",
publisher = "University of Queensland Press",

}

TY - JOUR

T1 - Relationships between the length of a longest path and the relative length

AU - Chiba, Shuya

AU - Matsubara, Ryota

AU - Tsugaki, Masao

PY - 2010

Y1 - 2010

N2 - Let G be a graph, and let p(G) and c(G) be the order of a longest path and a longest cycle of G, respectively. In [J. Graph Theory 30 (1999), 91-99], Saito proved that if G is a 2-connected graph with p(G) - c(G) ≥ 2, then p(G) ≥ σ 3(G) - 1. In this paper, we evaluate the length of a longest path of G by using σ 4(G). Specifically, our main results are the following. (i) If G is a 3-connected graph with p(G) - c(G) ≥ 3, then p(G) ≥ σ 4(G)-5, and (ii) if G is a 3-connected graph withp(G)-c(G) ≥ 2, then p(G) ≥ 3σ 4(G)/4-1. The statement (ii) is a generalization of Saito's theorem for 3-connected graphs. In fact, we characterize all graphs G with p(G) - c(G) ≥ 2 and p(G) = 3σ 4(G)/4-1. Following these results, we propose a conjecture, and obtain an application for the problem concerning the existence of vertex-disjoint paths.

AB - Let G be a graph, and let p(G) and c(G) be the order of a longest path and a longest cycle of G, respectively. In [J. Graph Theory 30 (1999), 91-99], Saito proved that if G is a 2-connected graph with p(G) - c(G) ≥ 2, then p(G) ≥ σ 3(G) - 1. In this paper, we evaluate the length of a longest path of G by using σ 4(G). Specifically, our main results are the following. (i) If G is a 3-connected graph with p(G) - c(G) ≥ 3, then p(G) ≥ σ 4(G)-5, and (ii) if G is a 3-connected graph withp(G)-c(G) ≥ 2, then p(G) ≥ 3σ 4(G)/4-1. The statement (ii) is a generalization of Saito's theorem for 3-connected graphs. In fact, we characterize all graphs G with p(G) - c(G) ≥ 2 and p(G) = 3σ 4(G)/4-1. Following these results, we propose a conjecture, and obtain an application for the problem concerning the existence of vertex-disjoint paths.

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

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

M3 - Article

VL - 47

SP - 91

EP - 107

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

ER -