Paths and cycles in colored graphs

Xueliang Li, Shenggui Zhang, Hajo Broersma

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publication1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Subtitle of host publication31 December 200105-31 December 200107 • Cologne, Germany
EditorsJohann Hurink, Stefan Pickl, Hajo Broersma, Ulrich Faigle
PublisherElsevier
Pages128-132
DOIs
Publication statusPublished - 2001
Event1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001 - University of Cologne, Cologne, Germany
Duration: 6 Jun 20018 Jun 2001
Conference number: 1

Publication series

NameElectronic Notes in Discrete Mathematics
PublisherElsevier
Volume8
ISSN (Print)1571-0653

Workshop

Workshop1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001
Abbreviated titleCTW
CountryGermany
CityCologne
Period6/06/018/06/01

Keywords

  • Monochromatic (heterochromatic) path (cycle)
  • (Edge-)colored graph

Fingerprint Dive into the research topics of 'Paths and cycles in colored graphs'. Together they form a unique fingerprint.

Cite this