Every planar graph is 4-colourable - two proofs without computer
Year: 2004
Type: article
Author: Peter Doerre
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1624322270