平面图表着色三路可拓的多项式方法

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2025-01-24 DOI:10.1002/jgt.23214

Przemysław Gordinowicz, Paweł Twardowski

{"title":"平面图表着色三路可拓的多项式方法","authors":"Przemysław Gordinowicz, Paweł Twardowski","doi":"10.1002/jgt.23214","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>We restate Thomassen's theorem of 3-extendability (Thomassen, Journal of Combinatorial Theory Series B, 97, 571–583), an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon–Tarsi equivalent of 3-extendability.</p>\n </div>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"109 2","pages":"237-254"},"PeriodicalIF":0.9000,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Polynomial Method for Three-Path Extendability of List Colourings of Planar Graphs\",\"authors\":\"Przemysław Gordinowicz, Paweł Twardowski\",\"doi\":\"10.1002/jgt.23214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>We restate Thomassen's theorem of 3-extendability (Thomassen, Journal of Combinatorial Theory Series B, 97, 571–583), an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon–Tarsi equivalent of 3-extendability.</p>\\n </div>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"109 2\",\"pages\":\"237-254\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23214\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23214","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们用图多项式的形式重申了Thomassen的3-可扩展性定理（Thomassen, Journal of Combinatorial Theory Series B, 97, 571-583），这是著名的平面5-可选择性定理的推广。这产生了相当于3-可扩展性的Alon-Tarsi。

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

查看原文本刊更多论文

The Polynomial Method for Three-Path Extendability of List Colourings of Planar Graphs

We restate Thomassen's theorem of 3-extendability (Thomassen, Journal of Combinatorial Theory Series B, 97, 571–583), an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon–Tarsi equivalent of 3-extendability.

求助全文

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

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .