"A sharp lower bound on the number of non-equivalent colorings of graphs of ..."

Romain Absil et al. (2018)

Details and statistics

DOI: 10.1016/J.DAM.2016.06.025

access: closed

type: Journal Article

metadata version: 2020-02-20

a service of  Schloss Dagstuhl - Leibniz Center for Informatics