"Every 3-connected {K1, 3, N1, 2, 3}-free graph is ..."

Zhiquan Hu, Shunzhe Zhang (2016)

> Home

Details and statistics

DOI: 10.1007/S00373-015-1598-2

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/HuZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/HuZ16
Zhiquan Hu, Shunzhe Zhang:
Every 3-connected {K_{1, 3}, N_{1, 2, 3}}-free graph is Hamilton-connected. Graphs Comb. 32(2): 685-705 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.