Factor d-domatic colorings of graphs

@article{Alon2003FactorDC,
  title={Factor d-domatic colorings of graphs},
  author={Noga Alon and Guillaume Fertin and Arthur L. Liestman and Thomas C. Shermer and Ladislav Stacho},
  journal={Discrete Mathematics},
  year={2003},
  volume={262},
  pages={17-25}
}
Consider a graph and a collection of (not necessarily edge-disjoint) connected spanning subgraphs (factors) of the graph. We consider the problem of coloring the vertices of the graph so that each color class of the vertices dominates each factor. We 5nd upper and lower bounds on (t; k), which we de5ne as the minimum radius of domination d such that every graph with a collection of k factors can be vertex colored with t colors so that each color class d-dominates each factor. It is perhaps… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

LovM asz, Problems and results on 3-chromatic hypergraphs and some related questions

L. P. ErdR os
Colloq. Math. Soc. JM anos Bolyai • 1973
View 4 Excerpts
Highly Influenced

Fundamentals of Domination in Graphs

T. W. Haynes, S. T. Hedetniemi, P. J. Slater
Marcel Dekker, New York • 1998
View 1 Excerpt

Global domination

R. C. Brigham, J. R. Carrington
in: T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Domination in Graphs—Advanced Topics, Marcel Dekker, New York • 1998
View 2 Excerpts

Factor domination in graphs

Discrete Mathematics • 1990
View 2 Excerpts

The global domination number of a graph

E. Sampathkumar
J. Math. Phys. Sci. 23(5) • 1989
View 1 Excerpt

Similar Papers

Loading similar papers…