Back to Search
Start Over
Three-rainbow coloring of split graphs.
- Source :
- Transactions of Tianjin University; Jun2015, Vol. 21 Issue 3, p284-287, 4p
- Publication Year :
- 2015
-
Abstract
- After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O( m) is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum number of colors needed in a 3-rainbow coloring. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10064982
- Volume :
- 21
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Transactions of Tianjin University
- Publication Type :
- Academic Journal
- Accession number :
- 103122859
- Full Text :
- https://doi.org/10.1007/s12209-015-2431-y