Rainbow Induced Subgraphs in Replication Graphs

Details Rainbow Induced Subgraphs in Replication Graphs Rainbow Induced Subgraphs in Replication Graphs

2012-01-25

arxiv.org/abs/1201.5340v1

Computer Science

Discrete Mathematics

Scientific paper

A graph $G$ is called a replication graph of a graph $H$ if $G$ is obtained from $H$ by replacing vertices of $H$ by arbitrary cliques of vertices and then replacing each edge in $H$ by all the edges between corresponding cligues. For a given graph $H$ the $\rho_R(H)$ is the minimal number of vertices of a replication graph $G$ of $H$ such that every proper vertex coloring of $G$ contains a rainbow induced subgraph isomorphic to $H$ having exactly one vertex in each replication clique of $G$. We prove some bounds for $\rho_R$ for some classes of graphs and compute some exact values. Also some experimental results obtained by a computer search are presented and conjectures based on them are formulated.

Affiliated with

Also associated with

No associations

Rating

Rainbow Induced Subgraphs in Replication Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rainbow Induced Subgraphs in Replication Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rainbow Induced Subgraphs in Replication Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683753