边色平面和外平面图中的彩虹子图

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters Pub Date : 2023-06-23 DOI:10.47443/dml.2023.048

J. Czap

{"title":"边色平面和外平面图中的彩虹子图","authors":"J. Czap","doi":"10.47443/dml.2023.048","DOIUrl":null,"url":null,"abstract":"Let G be a class of graphs. The strong rainbow number of the graph H in G is the minimum number of colors k such that every graph G ∈ G admits an edge coloring with at most k colors in which all copies of H are rainbow (i","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rainbow subgraphs in edge-colored planar and outerplanar graphs\",\"authors\":\"J. Czap\",\"doi\":\"10.47443/dml.2023.048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a class of graphs. The strong rainbow number of the graph H in G is the minimum number of colors k such that every graph G ∈ G admits an edge coloring with at most k colors in which all copies of H are rainbow (i\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

设G是一类图。图H在G中的强彩虹数是使每一个图G∈G允许有最多k种颜色的边着色且H的所有副本都是彩虹(i)的最小颜色数k

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Rainbow subgraphs in edge-colored planar and outerplanar graphs

Let G be a class of graphs. The strong rainbow number of the graph H in G is the minimum number of colors k such that every graph G ∈ G admits an edge coloring with at most k colors in which all copies of H are rainbow (i

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊