Heavy subgraph pairs for traceability of block-chains

Autor: Li Binlong, Broersma Hajo, Zhang Shenggui

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)

A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-typ

Externí odkaz: https://doaj.org/article/8a2b714b768147569667b7e7e4c1a5b1

Forbidden subgraph pairs for traceability of block-chains

Autor: Haitze J. Broersma, Shenggui Zhang, Binlong Li

Publikováno v: Electronic Journal of Graph Theory and Applications, Vol 1, Iss 1, Pp 1-10 (2013)
Electronic journal of graph theory and applications, 1(1), 1-10. Indonesian Combinatorics Society

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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c513d517d76d379301392d1b9c8f4bc5
https://doi.org/10.5614/ejgta.2013.1.1.1