关于有符号图的着色和方向

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters Pub Date : 2023-07-07 DOI:10.47443/dml.2023.080

Daniel C. Slilaty

{"title":"关于有符号图的着色和方向","authors":"Daniel C. Slilaty","doi":"10.47443/dml.2023.080","DOIUrl":null,"url":null,"abstract":"A classical theorem independently due to Gallai and Roy states that a graph G has a proper k -coloring if and only if G has an orientation without coherent paths of length k . An analogue of this result for signed graphs is proved in this article.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On colorings and orientations of signed graphs\",\"authors\":\"Daniel C. Slilaty\",\"doi\":\"10.47443/dml.2023.080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A classical theorem independently due to Gallai and Roy states that a graph G has a proper k -coloring if and only if G has an orientation without coherent paths of length k . An analogue of this result for signed graphs is proved in this article.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-07-07\",\"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.080\",\"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.080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

一个由Gallai和Roy独立提出的经典定理指出，当且仅当图G具有不具有长度为k的相干路径的方向时，图G具有适当的k着色。本文证明了对有符号图的类似结果。

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

查看原文

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

本刊更多论文

On colorings and orientations of signed graphs

A classical theorem independently due to Gallai and Roy states that a graph G has a proper k -coloring if and only if G has an orientation without coherent paths of length k . An analogue of this result for signed graphs is proved in this article.

求助全文

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

来源期刊