Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Every longest circuit of a 3-connected, K3, 3-minor free ..."

Etienne Birmelé (2008)

> Home

Details and statistics

DOI: 10.1002/JGT.20312

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/Birmele08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Birmele08
Etienne Birmelé:
Every longest circuit of a 3-connected, K_{3, 3}-minor free graph has a chord. J. Graph Theory 58(4): 293-298 (2008)

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.