"A sufficient condition for planar graphs to be 3-colorable."

Oleg V. Borodin, André Raspaud (2003)

Details and statistics

DOI: 10.1016/S0095-8956(03)00025-X

access: open

type: Journal Article

metadata version: 2021-02-16

a service of  Schloss Dagstuhl - Leibniz Center for Informatics