Title of article
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
Author/Authors
A. and ءgueda، نويسنده , , R. and Borozan، نويسنده , , Alexander V. and Manoussakis، نويسنده , , Y. and Mendy، نويسنده , , G. and Muthu، نويسنده , , R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
6
From page
2694
To page
2699
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.
Keywords
sufficient conditions , Edge-colored graphs , Proper spanning trees
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600079
Link To Document