Traceability on 2-connected line graphs

Tao Tian and Liming Xiong

Applied Mathematics and Computation, 2018, vol. 321, issue C, 463-471

Abstract: In this paper, we mainly prove the following: Let G be a connected almost bridgeless simple graph of order n sufficiently large such that σ¯2(G)=min{d(u)+d(v):uv∈E(G)}≥2(⌊n/11⌋−1). Then either L(G) is traceable or Catlin’s reduction of the core of G is one of eight graphs of order 10 or 11, where the core of G is obtained from G by deleting the vertices of degree 1 of G and replacing each path of length 2 whose internal vertex has degree 2 in G by an edge. We also give a new proof for the similar theorem in Niu et al. (2012) which has flaws in their proof.

Keywords: Traceable; Line graph; Spanning trail; Dominating trail (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317307427
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:321:y:2018:i:c:p:463-471

DOI: 10.1016/j.amc.2017.10.043

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().