"Bipartite graphs with every k-matching in a Hamiltonian cycle."

Miao Wang, Yan Liu (2018)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2018-02-14

- no documents available
- export record
  dblp key:
  - journals/arscom/WangL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/WangL18
Miao Wang, Yan Liu:
Bipartite graphs with every k-matching in a Hamiltonian cycle. Ars Comb. 136: 181-197 (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.