Paths and cycles in colored graphs

Li, Xueliang and Zhang, Shenggui and Broersma, Hajo (2001) Paths and cycles in colored graphs. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 128-132.

PDF
Restricted to UT campus only
148Kb

Abstract:	Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all the edges of it have the same color, and is called heterochromatic if all the edges of it have different colors. In this note, some sufficient conditions for the existence of monochromatic and heterochromatic paths and cycles are obtained. We also propose a conjecture on the existence of paths and cycles with many colors.
Item Type:	Book Section
Copyright:	© 2001 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/74500
Official URL:	http://dx.doi.org/10.1016/S1571-0653(05)80098-8
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page