The upper bound of the number of cycles in a 2-factor of a line graph

Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most 3n-2/8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.

Original languageEnglish
Pages (from-to)72-82
Number of pages11
JournalJournal of Graph Theory
Volume55
Issue number1
DOIs
Publication statusPublished - 2007 May
Externally publishedYes

Fingerprint

Line Graph
Minimum Degree
Simple Graph
Branch
Upper bound
Cycle
Odd

Keywords

  • 2-factor
  • Line graph
  • Number of components

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

The upper bound of the number of cycles in a 2-factor of a line graph. / Fujisawa, Jun; Xiong, Liming; Yoshimoto, Kiyoshi; Zhang, Shenggui.

In: Journal of Graph Theory, Vol. 55, No. 1, 05.2007, p. 72-82.

Research output: Contribution to journalArticle

Fujisawa, Jun ; Xiong, Liming ; Yoshimoto, Kiyoshi ; Zhang, Shenggui. / The upper bound of the number of cycles in a 2-factor of a line graph. In: Journal of Graph Theory. 2007 ; Vol. 55, No. 1. pp. 72-82.
@article{23b3a8691feb44fa8161684d6045748c,
title = "The upper bound of the number of cycles in a 2-factor of a line graph",
abstract = "Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most 3n-2/8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.",
keywords = "2-factor, Line graph, Number of components",
author = "Jun Fujisawa and Liming Xiong and Kiyoshi Yoshimoto and Shenggui Zhang",
year = "2007",
month = "5",
doi = "10.1002/jgt.20220",
language = "English",
volume = "55",
pages = "72--82",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - The upper bound of the number of cycles in a 2-factor of a line graph

AU - Fujisawa, Jun

AU - Xiong, Liming

AU - Yoshimoto, Kiyoshi

AU - Zhang, Shenggui

PY - 2007/5

Y1 - 2007/5

N2 - Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most 3n-2/8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.

AB - Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most 3n-2/8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.

KW - 2-factor

KW - Line graph

KW - Number of components

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

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

U2 - 10.1002/jgt.20220

DO - 10.1002/jgt.20220

M3 - Article

VL - 55

SP - 72

EP - 82

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -