Tough graphs and Hamiltonian circuits

Chvátal, V. (1973). Tough graphs and Hamiltonian circuits. Discrete Mathematics, 5(3), 215-228.

Type

Journal article

Intellectual base

Primary research

Year

1973

Volume

5

Issue

3

Pages

215-228

ISSN

0012-365X

DOI

10.1016/0012-365x(73)90138-6

DOI registrant

Elsevier

Link

https://doi.org/10.1016/0012-365X(73)90138-6

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Graph Toughness

  • This sourceUsed here only for historical provenance; the full text was not assumed accessible.

Verification

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

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:f158c4ebcf92 · see in the full table