Homomorphisms of 2-edge-colored graphs |
| |
| Institution: | 1. Department of Pure and Applied Mathematics, University of Johannesburg, Auckland Park 2006, South Africa;2. Department of Mathematics and Statistics, University of Houston–Downtown, Houston, TX 77002, USA |
| |
| Abstract: | In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a 2-edge-colored graph H such that each graph of the considered class admits a homomorphism to H. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
