Conflict-Free Colouring of Graphs (original) (raw)
Related papers
On the Strong Chromatic Number of Random Graphs
Combinatorics, Probability and Computing, 2007
The Chromatic Number of Random Graphs for Most Average Degrees
International Mathematics Research Notices, 2015
On the Game Chromatic Number of Sparse Random Graphs
SIAM Journal on Discrete Mathematics, 2013
Remarks on proper conflict-free colorings of graphs
Discrete Mathematics
Conflict-Free Coloring of Graphs
SIAM Journal on Discrete Mathematics
On the upper bound of the non-3-colourability threshold of random graphs
2002
A Note on the Non-Colorability Threshold of a Random Graph
The Electronic Journal of Combinatorics
An upper bound for the chromatic number of line graphs
European Journal of Combinatorics, 2007
On the Domination Number of a Random Graph
The Electronic Journal of Combinatorics, 2001
1 The maximum number of colorings of graphs of given order and size
2015
On the chromatic number of graphs
2001
A new upper bound for the chromatic number of a graph
Discussiones Mathematicae Graph Theory, 2007
An Erdős-Gallai type theorem for vertex colored graphs
Graphs and Combinatorics, 2019
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Discrete Applied Mathematics, 2012
On the dominated chromatic number of certain graphs
arXiv: Combinatorics, 2019
A Bound on the Total Chromatic Number
COMBINATORICA, 1998
The maximum number of colorings of graphs of given order and size: A survey
Discrete Mathematics
On the dynamic coloring of graphs
Discrete Applied Mathematics, 2011
Improved bounds on coloring of graphs
European Journal of Combinatorics, 2012
On the phase transitions of graph coloring and independent sets
Physica A: Statistical Mechanics and its Applications, 2004
On Coloring Properties of Graph Powers
Hossein Hajiabolhassan, Ali Taherkhani
An upper bound for the total chromatic number
Graphs and Combinatorics, 1990
Upper Bounds for the Dynamic Chromatic Number of Graphs in Terms of the Independent Number
Arxiv preprint arXiv:0911.4199, 2009
On the chromatic number of a random 5-regular graph
Journal of Graph Theory, 2009
Graphs and Combinatorics, 2014
Ju l 2 01 8 Fractional chromatic number of a random subgraph
2018
Maximum edge-colorings of graphs
Discussiones Mathematicae Graph Theory, 2015
Coloring the Maximal Cliques of Graphs
SIAM Journal on Discrete Mathematics, 2004
2009
Some remarks on the chromatic index of a graph
Archiv der Mathematik, 1973
Nonrepetitive vertex colorings of graphs
Discrete Mathematics, 2012
ON COLORINGS AVOIDING A RAINBOW CYCLE AND A FIXED MONOCHROMATIC SUBGRAPH
2010
Two upper bounds on the chromatic number
2009
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
Bolyai Society Mathematical Studies, 2013