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 journalArticlepeer-review

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

Keywords

  • 2-factor
  • Line graph
  • Number of components

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'The upper bound of the number of cycles in a 2-factor of a line graph'. Together they form a unique fingerprint.

Cite this