Laurent polynomials of planar graphs
Mariusz Zaj\k{a}c
TL;DR
This paper introduces Laurent graph polynomials to simplify the process of determining the Alon-Tarsi numbers of planar graphs by allowing negative powers of variables.
Contribution
It proposes a novel approach using Laurent polynomials, which streamlines existing methods for analyzing planar graphs' coloring properties.
Findings
Simplified method for calculating Alon-Tarsi numbers
Application of Laurent polynomials to planar graphs
Enhanced understanding of graph coloring constraints
Abstract
By using Laurent graph polynomials instead of the usual ones, i.e. by allowing negative powers of the variables, we simplify an existing method of determining the Alon-Tarsi numbers of planar graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · graph theory and CDMA systems