We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
Peter J. Cameron, Ashley Montanaro, Michael W. New...
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
A massive rise in the number and expenditure of pathology ordering by general practitioners (GPs) concerns the government and attracts various studies with the aim to understand a...
Zoe Yan Zhuang, Rasika Amarasiri, Leonid Churilov,...
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...