{"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}
引用次数: 0
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
