Abstract Universal targets for homomorphisms of edge-colored graphs
首页> 外文期刊>Journal of Combinatorial Theory, Series B >Universal targets for homomorphisms of edge-colored graphs
【24h】

Universal targets for homomorphisms of edge-colored graphs

机译:边缘彩色图形的普遍目标

获取原文
获取原文并翻译 | 示例
           

摘要

AbstractAk-edge-colored graph is a finite, simple graph with edges labeled by numbers1,,k. A function from the vertex set of onek-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two different vertices connected by an edge of the same color. Given a classFof graphs, ak-edge-colored graphH(not necessarily with the underlying graph inF) isk-universal forFwhen anyk-edge-colored graph with the underlying graph inFadmits a homomorphism to
机译:<![cdata [ Abstract a k - 光彩图是一个有限的,简单的图表,边缘标有数字< MML:MATH XMLNS:MML =“http://www.w3.org/1998/math/mathml”altimg =“si1.gif”display =“内联”overflow =“滚动”> 1 ... k 。从一个 k --ded-oly图形到另一个的函数是同性恋,如果任何边缘的端点映射到由相同颜色的边缘连接的两个不同的顶点。给定类 f 图表,a k - 光彩图 h (不一定是在 f )是 k -universal for < MML:MATH XMLNS:MML =“http://www.w3.org/1998/math/mathml”altimg =“si2.gif”display =“内联”overflow =“滚动”> f 当任何 k 与底层图中的图形图中的 F 承认同性恋到

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号