Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem

G Cornuéjols, W. R. P. (1983). Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem.

Type

Unclassified

Intellectual base

Unclassified

Year

1983

DOI

10.1007/bf02579340

Link

https://doi.org/10.1007/bf02579340

Cited by

1 citation across 1 artifact.

Domain-specific

• Factor-critical graph
  • A factor-critical graph is a graph G such that G minus v has a perfect matching for every vertex v.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:9a03e58e770f · see in the full table