Cuts and bounds


Weconsider the colouring (or homomorphism) orderC induced by all finite graphs and the existence of a homomorphism between them. This ordering may be seen as a lattice which is far from being complete. In this paper we study bounds and suprema and maximal elements in C of some frequently studied classes of graphs (such as bounded degree, degenerated and… (More)
DOI: 10.1016/j.disc.2004.07.034


Cite this paper

@article{Nesetril2005CutsAB, title={Cuts and bounds}, author={Jaroslav Nesetril and Patrice Ossona de Mendez}, journal={Discrete Mathematics}, year={2005}, volume={302}, pages={211-224} }