Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

An s-Hamiltonian line graph problem

Language

English

Abstract

For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399-407 (1987)), Broersma and Veldman proposed an open problem: for a given positive integer k, determine the value s for which the statement "Let G be a k-triangular graph. Then L(G), the line graph of G, is s-hamiltonian if and only L(G) is (s + 2)-connected" is valid. Broersma and Veldman proved in 1987 that the statement above holds for 0 ≤ s ≤ k and asked, specifically, if the statement holds when s = 2k. In this paper, we prove that the statement above holds for 0 ≤ s ≤ max{2k, 6k - 16}. © 2007 Springer-Verlag Tokyo.

Publication Date

2007

Source Publication Title

Graphs and Combinatorics

Volume

23

Issue

3

Start Page

241

End Page

248

Publisher

Springer Verlag

DOI

10.1007/s00373-007-0727-y

Link to Publisher's Edition

http://dx.doi.org/10.1007/s00373-007-0727-y

ISSN (print)

09110119

ISSN (electronic)

14355914

This document is currently not available here.

Share

COinS