Work

Every planar map is four colorable. Part II: Reducibility

Year: 1977

Type: article

Source: Illinois Journal of Mathematics

DOI: 10.1215/ijm/1256049012

Authors: K. Appel, W. Haken, J. Koch

Institutions: University of Illinois Urbana-Champaign, University of Illinois System

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1566410171

FWCI: 5.137

Cites:

Cited by: 738

Related to: 10