Clique coloring of binomial random graphs
Work
Year: 2018
Type: article
Abstract: A clique coloring of a graph is a coloring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colors in such a coloring is the clique chrom... more
Source: Random Structures and Algorithms
Institutions University of Oxford, Laboratoire Jean-Alexandre Dieudonné, Fields Institute for Research in Mathematical Sciences, Toronto Metropolitan University
Cites: 25
Cited by: 6
Related to: 10
FWCI: 0.629
Citation percentile (by year/subfield): 79.76
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green