"Note on the complexity of deciding the rainbow (vertex-) connectedness for ..."

Shasha Li, Xueliang Li, Yongtang Shi (2015)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2015.02.015

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/LiLS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/LiLS15
Shasha Li, Xueliang Li, Yongtang Shi:
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. Appl. Math. Comput. 258: 155-161 (2015)

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.