"Every 2-choosable graph is (2m, m)-choosable."

Zsolt Tuza, Margit Voigt (1996)

Details and statistics

DOI: 10.1002/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M

access: closed

type: Journal Article

metadata version: 2020-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics