"Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable."

Ming Chen et al. (2016)

Details and statistics

DOI: 10.1016/J.DISC.2015.10.029

access: open

type: Journal Article

metadata version: 2023-05-03

a service of  Schloss Dagstuhl - Leibniz Center for Informatics