Chromatic polynomials of signed Petersen graphs
MSRI-UP 2012: Enumerative Combinatorics June 16, 2012 - July 29, 2012
Location: MSRI: Baker Board Room
T. Zaslavsky proved that there are essentially six signed versions of the famous Petersen graph. (Look here for an introduction to signed graphs.) He conjectures that they all have different chromatic polynomials. We will try to compute the latter, e.g., using A. Van Herick's IOP software.
Please report video problems to firstname.lastname@example.org.
See more of our Streaming videos on our main VMath Videos page.