Author:
Chudnovsky Maria,Goedgebeur Jan,Schaudt Oliver,Zhong Mingxian
Funder
NSF
Research Foundation Flanders
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Three-coloring and list three-coloring graphs without induced paths on seven vertices;Bonomo;Combinatorica,2018
2. House of graphs: a database of interesting graphs;Brinkmann;Discrete Appl. Math.,2013
3. A certifying algorithm for 3-colorability of P5-free graphs;Bruce,2009
4. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006
5. Obstructions for three-coloring graphs with one forbidden induced subgraph;Chudnovsky,2016
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献