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

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

Type

Journal article

Intellectual base

Primary research

Year

1983

DOI

10.1007/bf02579340

DOI registrant

Springer Nature

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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