"A sufficient condition for planar graphs to be (3, 1)-choosable."

Min Chen et al. (2017)

Details and statistics

DOI: 10.1007/S10878-017-0124-2

access: closed

type: Journal Article

metadata version: 2020-04-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics