Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Longest cycles in 3-connected graphs contain three contractible edges."

Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota (1989)

> Home

Details and statistics

DOI: 10.1002/JGT.3190130105

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/DeanHO89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/DeanHO89
Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota:
Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13(1): 17-21 (1989)

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.