default search action

combined dblp search
author search
venue search
publication search

ask others

"Every finite strongly connected digraph of stability 2 has a Hamiltonian path."

C. C. Chen, P. Manalastas (1983)

> Home

Details and statistics

DOI: 10.1016/0012-365X(83)90188-7

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/ChenM83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/ChenM83
C. C. Chen, P. Manalastas:
Every finite strongly connected digraph of stability 2 has a Hamiltonian path. Discret. Math. 44(3): 243-250 (1983)

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.