Author:
Maffray Frédéric,Pastor Lucas
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. A linear-time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;Inform. Process. Lett.,1979
2. F. Bonomo, O. Schaudt, M. Stein, 3-Colouring graphs without triangles or induced paths on seven vertices. arXiv:1410.0040.
3. P6- and triangle-free graphs revisited: Structure and bounded clique-width;Brandstädt;Discrete Math. Theoret. Comput. Sci.,2006
4. C. Brause, I. Schiermeyer, P. Holub, Z. Ryjáček, P. Vrána, R. Krivoš-Belluš, 4-colorability of P6-free graphs, in: Proc. EuroComb 2015, in: Electronic Notes in Discrete Mathematics.
5. Three complexity results on coloring Pk-free graphs;Broersma;European J. Combin.,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Critical (P6,banner)-free graphs;Discrete Applied Mathematics;2019-04