F-WORM colorings: Results for 2-connected graphs


Given two graphs F andG, an F-WORMcoloring ofG is an assignment of colors to its vertices in such a way that no F-subgraph of G is monochromatic or rainbow. If G has at least one such coloring, then it is called F-WORM colorable and W(G, F ) denotes the minimum possible number of colors. Here, we consider F-WORM colorings with a fixed 2-connected graph F… (More)
DOI: 10.1016/j.dam.2017.05.008


2 Figures and Tables

Cite this paper

@article{Bujts2017FWORMCR, title={F-WORM colorings: Results for 2-connected graphs}, author={Csilla Bujt{\'a}s and Zsolt Tuza}, journal={Discrete Applied Mathematics}, year={2017}, volume={231}, pages={131-138} }