The graph polynomial and the number of proper vertex colorings

DOI10.5802/AIF.1707zbMath0924.05027OpenAlexW1965019888MaRDI QIDQ1296159

Michael Tarsi

Publication date: 12 July 1999

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_1999__49_3_1089_0

zbMATH Keywords

graph polynomialEulerian orientationsedge-orientationsproper vertex colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On two generalizations of the Alon-Tarsi polynomial method ⋮ Parity, Eulerian subgraphs and the Tutte polynomial ⋮ On the parity of colourings and flows

Cites Work

• Unnamed Item
• Colorings and orientations of graphs
• A solution to a colouring problem of P. Erdős
• A note on graph colorings and graph polynomials

This page was built for publication: The graph polynomial and the number of proper vertex colorings