Construct · 1 fields · 1 citations

Dirac's theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

theorem that a graph on n vertices whose minimum degree is at least n over two contains a Hamiltonian cycle.

In graph theory, Dirac's theorem refers to theorem that a graph on n vertices whose minimum degree is at least n over two contains a Hamiltonian cycle. This meaning comes from Dirac (1952) in Proceedings of the London Mathematical Society.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Dirac's theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

cycle4 fields · 4 citationsjingle · one word, four constructs degree1 fields · 1 citationsanchor · a standalone construct

References

Dirac, G. A. (1952). Some Theorems on Abstract Graphs. Proceedings of the London Mathematical Society, s3-2(1), 69-81. https://doi.org/10.1112/plms/s3-2.1.69

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct