"Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is ..."

Zdenek Ryjácek, Petr Vrána (2021)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2021.112350

access: closed

type: Journal Article

metadata version: 2021-04-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/RyjacekV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/RyjacekV21
Zdenek Ryjácek, Petr Vrána:
Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected. Discret. Math. 344(6): 112350 (2021)

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.