Sciweavers

JGT
2007
99views more  JGT 2007»
13 years 4 months ago
The upper bound of the number of cycles in a 2-factor of a line graph
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-fa...
Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, She...