98 citations · 348 across the 30 of their papers we have counts for
3 papers · 1 filter
The Chromatic Polynomials of Signed Petersen Graphs
Matthias Beck, Erika Meza, Bryan Nevarez +2
Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by show…
Nowhere-Zero -Flows on Graphs
Matthias Beck, Alyssa Cuyjet, Gordon Rojas Kirby +2
We introduce and study a multivariate function that counts nowhere-zero flows on a graph G, in which each edge of G has an individual capacity. We prove that the associated countin…
Sum list coloring, the sum choice number, and sc-greedy graphs
Michelle Lastrina, Michael Young
Let G=(V,E) be a graph and let f be a function that assigns list sizes to the vertices of G. It is said that G is f-choosable if for every assignment of lists of colors to the vert…