András Gyárfás, Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy
{"title":"Proper edge colorings of planar graphs with rainbow \u0000 \u0000 \u0000 \u0000 \u0000 C\u0000 4\u0000 \u0000 \u0000 \u0000 ${C}_{4}$\u0000 -s","authors":"András Gyárfás, Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy","doi":"10.1002/jgt.23163","DOIUrl":"10.1002/jgt.23163","url":null,"abstract":"<p>We call a proper edge coloring of a graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> a B-coloring if every 4-cycle of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math> is colored with four different colors. Let <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>q</mi>\u0000 \u0000 <mi>B</mi>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${q}_{B}(G)$</annotation>\u0000 </semantics></math> denote the smallest number of colors needed for a B-coloring of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> $G$</annotation>\u0000 </semantics></math>. Motivated by earlier papers on B-colorings, here we consider <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>q</mi>\u0000 \u0000 <mi>B</mi>\u0000 </msub>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${q}_{B}(G)$</annotation>\u0000 </semantics></math> for planar and outerplanar graphs in terms of the maximum degree <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>Δ</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mi>Δ</mi>\u0000 \u0000 <mrow>\u0000 <mo>(</mo>\u0000 \u0000 <mi>G</mi>\u0000 \u0000 <mo>)</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 <annotation> ${rm{Delta }}={rm{Delta }}(G)$</annotation>\u0000 </sem","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"107 4","pages":"833-846"},"PeriodicalIF":0.9,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141943351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0