Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648142 | Discrete Mathematics | 2012 | 6 Pages |
Abstract
In this paper we study the existence of properly colored spanning trees in edge-colored graphs, under certain assumptions on the graph, both structural and related to the coloring. The general problem of proper spanning trees in edge-colored graphs is not only combinatorially difficult but also computationally hard. Here, we focus on some questions of this important combinatorial problem on sufficient degrees involving connectivity and colored degrees.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
R. Águeda, V. Borozan, Y. Manoussakis, G. Mendy, R. Muthu,