An asymptotic bound for the strong chromatic number (2019)
Attributed to:
A graph theoretical approach for combinatorial designs
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1017/s0963548318000561
Publication URI: http://dx.doi.org/10.1017/s0963548318000561
Type: Journal Article/Review
Parent Publication: Combinatorics, Probability and Computing
Issue: 5