Binlong Li
Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Forbidden subgraph pairs for traceability of block-chains Binlong Li; Hajo Broersma; Shenggui Zhang
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 1, No 1 (2013): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2013.1.1.1

Abstract

A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path. A traceable graph is clearly a block-chain, but the reverse does not hold in general.In this paper we characterize all pairs of connected graphs $\{R,S\}$ such that every $\{R,S\}$-free block-chain is traceable.