"Connected graph G with σ2(G)≥23n and K1, 4-free contains a ..."

Benjamin Momège (2018)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2018.02.024

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/Momege18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Momege18
Benjamin Momège:
Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path. Discret. Appl. Math. 247: 37-42 (2018)

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.