Graph matching

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

A matching in a finite graph is an edge subset whose edges share no endpoints; the empty matching is allowed.

atlas-graph-matching · canonical_mko

Prerequisite nodes