Message Boards Message Boards

GROUPS:

Computing defective vertex colorings in graph theory

Posted 3 months ago
1199 Views
|
3 Replies
|
5 Total Likes
|

POSTED BY: Robert Cowen
3 Replies

enter image description here -- you have earned Featured Contributor Badge enter image description here Your exceptional post has been selected for our editorial column Staff Picks http://wolfr.am/StaffPicks and Your Profile is now distinguished by a Featured Contributor Badge and is displayed on the Featured Contributor Board. Thank you!

POSTED BY: Moderation Team

Thanks for the interesting article - can the Tutte polynomial be used to calculate defective vertex colourings?

POSTED BY: Bruce Miller

I am not an expert on Chromatic polynomials, Tutte polynomials, etc., but a I understand it these graph polynomials tell how many colorings of a certain type the graph has, but do not compute specific colorings. Of course it may be useful to know when no coloring exists. However, they are difficult to compute for large graphs. There has I think been some work on computing Tutte polynomials for defective colorings.

POSTED BY: Robert Cowen
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract