A note on graph colorings and graph polynomials

DOI10.1006/jctb.1997.1753zbMath0883.05050OpenAlexW1988564791MaRDI QIDQ1369660

Michael Tarsi, Noga Alon

Publication date: 22 February 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e0e2f591a9babd1f8373ae987f56817409231431

zbMATH Keywords

chromatic numbercomplete graphsgraph polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On two generalizations of the Alon-Tarsi polynomial method ⋮ Computing the Chromatic Number Using Graph Decompositions via Matrix Rank ⋮ Parity, Eulerian subgraphs and the Tutte polynomial ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ Computing the chromatic number using graph decompositions via matrix rank ⋮ The graph polynomial and the number of proper vertex colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Colorings and orientations of graphs
• Bounding the Independence Number of a Graph

This page was built for publication: A note on graph colorings and graph polynomials