A note on graph colorings and graph polynomials
From MaRDI portal
Publication:1369660
DOI10.1006/jctb.1997.1753zbMath0883.05050MaRDI QIDQ1369660
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
05C15: Coloring of graphs and hypergraphs
Related Items
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank, On two generalizations of the Alon-Tarsi polynomial method, The graph polynomial and the number of proper vertex colorings, Univariate ideal membership parameterized by rank, degree, and number of generators, Computing the chromatic number using graph decompositions via matrix rank, Parity, Eulerian subgraphs and the Tutte polynomial
Cites Work