当前位置: 首页 / English / Academics / 正文

Matchings and related structures with Specified Color Properties In Vertex- or Edge-colored Graphs

作者:   时间:2019-05-31   点击数:

Title:Matchings and related structures with Specified Color Properties In Vertex- or Edge-colored Graphs

Keynote SpeakerYannis Manoussakis

Abstract

   We consider problems in edge- or vertex colored graphs. As an example, the Web graph may be considered as a vertex-colored graph where the color of a vertex represents the content of the corresponding page (red for mathematics, yellow for physics, etc.). When the edges/vertices of graphs are colored, then we talk about c-edge/vertex colored graphs (c is the number of colors), models which in fact generalize various classes of graphs. In general, one can observe that problems related to colored graphs often consist in finding subgraphs such as paths, cycles, matchings and trees, with, in addition, specified constraints on colors. In the case of c-edge-colored graphs, original problems correspond to extracting subgraphs, for example, Hamiltonian and Eulerian paths or cycles, trees, matchings etc., colored in some specified pattern. Here we survey a series of results concerning colored matchings in c-colored graphs, for arbitrarily c.

Speaker Introduction

Yannis Manoussakis

Inviter

Wang GuanghuiProfessor in School of Mathematics

Time

May 31(Sunday9:00-11:00

Location

Hall 924,Block B,Zhixin Building,Central Campus


Hosted by:School of Mathematics,Shandong University


地址:中国山东省济南市山大南路27号   邮编:250100  

电话:0531-88364652  院长信箱:sxyuanzhang@sdu.edu.cn

Copyright@ m6体育入口(上海)贸易公司

微信公众号