Indexed metadata

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

David P. Dailey

Source record

Source: Crossref

Published: Jan 1, 1980

DOI: 10.1016/0012-365x(80)90236-8

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete — Mathematical Frontier Network