List k-critical graphs without long induced paths |
HomeAuthorsMingxian Zhong |
List k-critical graphs without long induced pathsThe algorithms used in the generators ListCriticalPfreeGraphs and ListSize2Obstructions are described in:
ListCriticalPfreeGraphs is a program for generating all list k-critical Pt-free graphs. The generator can be downloaded here and a short manual can be found here. ListCriticalPfreeGraphs is released under the GNU General Public License (GPL) and has been tested on Linux and Mac OS X. Installation instructions:
Note: a program for generating k-critical Pt-free graphs can be found here. Several complete lists of list k-critical H-free graphs can be found at the House of Graphs. ListSize2Obstructions is a program for generating obstructions for list k-colourability where each vertex has exactly two possible colours (also called k-propagation paths). The generator can be downloaded here and a short manual can be found here. ListSize2Obstructions is released under the GNU General Public License (GPL) and has been tested on Linux and Mac OS X. Installation instructions:
Don't hesitate to contact us at jan.goedgebeur[at]ugent.be if you have any further questions or suggestions. |