"The smallest hard-to-color graph for algorithm DSATUR."

Robert Janczewski et al. (2001)

Details and statistics

DOI: 10.1016/S0012-365X(00)00439-8

access: open

type: Journal Article

metadata version: 2021-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics