Fan-type theorem for a long path passing through a specified vertex

Hikoe Enomoto, Jun Fujisawa

Research output: Contribution to journalArticle

Abstract

Let G be a 2-connected graph with maximum degree Δ(G) ≥ d, x and z be distinct vertices of G, and W be a subset of V (G)\{x, z} such that |W| ≤ d - 1. Hirohata proved that if max{dG(u), dG(v)} ≥ d for every pair of vertices u, v ∈ V(G)\({x,z} ∪ W) such that d G(u, v) = 2, then x and z are joined by a path of length at least d - |W|. In this paper, we show that if G satisfies the conditions of Hirohata's theorem, then for any given vertex y such that dG(y) ≥ d, x and z are joined by a path of length at least d - |W| which contains y.

Original languageEnglish
Pages (from-to)129-136
Number of pages8
JournalArs Combinatoria
Volume90
Publication statusPublished - 2009 Jan

Fingerprint

Longest Path
Path
Vertex of a graph
Maximum Degree
Theorem
Connected graph
Distinct
Subset

Keywords

  • Fan-type condition
  • Long path

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Fan-type theorem for a long path passing through a specified vertex. / Enomoto, Hikoe; Fujisawa, Jun.

In: Ars Combinatoria, Vol. 90, 01.2009, p. 129-136.

Research output: Contribution to journalArticle

@article{4b0146165f06487584b0a7600040e7db,
title = "Fan-type theorem for a long path passing through a specified vertex",
abstract = "Let G be a 2-connected graph with maximum degree Δ(G) ≥ d, x and z be distinct vertices of G, and W be a subset of V (G)\{x, z} such that |W| ≤ d - 1. Hirohata proved that if max{dG(u), dG(v)} ≥ d for every pair of vertices u, v ∈ V(G)\({x,z} ∪ W) such that d G(u, v) = 2, then x and z are joined by a path of length at least d - |W|. In this paper, we show that if G satisfies the conditions of Hirohata's theorem, then for any given vertex y such that dG(y) ≥ d, x and z are joined by a path of length at least d - |W| which contains y.",
keywords = "Fan-type condition, Long path",
author = "Hikoe Enomoto and Jun Fujisawa",
year = "2009",
month = "1",
language = "English",
volume = "90",
pages = "129--136",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Fan-type theorem for a long path passing through a specified vertex

AU - Enomoto, Hikoe

AU - Fujisawa, Jun

PY - 2009/1

Y1 - 2009/1

N2 - Let G be a 2-connected graph with maximum degree Δ(G) ≥ d, x and z be distinct vertices of G, and W be a subset of V (G)\{x, z} such that |W| ≤ d - 1. Hirohata proved that if max{dG(u), dG(v)} ≥ d for every pair of vertices u, v ∈ V(G)\({x,z} ∪ W) such that d G(u, v) = 2, then x and z are joined by a path of length at least d - |W|. In this paper, we show that if G satisfies the conditions of Hirohata's theorem, then for any given vertex y such that dG(y) ≥ d, x and z are joined by a path of length at least d - |W| which contains y.

AB - Let G be a 2-connected graph with maximum degree Δ(G) ≥ d, x and z be distinct vertices of G, and W be a subset of V (G)\{x, z} such that |W| ≤ d - 1. Hirohata proved that if max{dG(u), dG(v)} ≥ d for every pair of vertices u, v ∈ V(G)\({x,z} ∪ W) such that d G(u, v) = 2, then x and z are joined by a path of length at least d - |W|. In this paper, we show that if G satisfies the conditions of Hirohata's theorem, then for any given vertex y such that dG(y) ≥ d, x and z are joined by a path of length at least d - |W| which contains y.

KW - Fan-type condition

KW - Long path

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

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

M3 - Article

AN - SCOPUS:60749116849

VL - 90

SP - 129

EP - 136

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -