Abstract
AbstractWe investigate natural dualities for classes of simple graphs. For example, we give a natural duality for the class consisting of all n-colourable graphs and show that, for all n≥3, there is no natural duality for the class consisting of all freely n-colourable graphs. We also prove that there exist arbitrarily long finite chains of 3-colourable graphs that alternate between being dualizable and nondualizable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
