Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Algorithmic proofs of two relations between connectivity and the 1-factors ..."

Harold N. Gabow (1979)

> Home

Details and statistics

DOI: 10.1016/0012-365X(79)90058-X

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/Gabow79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Gabow79
Harold N. Gabow:
Algorithmic proofs of two relations between connectivity and the 1-factors of a graph. Discret. Math. 26(1): 33-40 (1979)

a service of

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.