Paths and cycles in colored graphs


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

[img] PDF
Restricted to UT campus only

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
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page