Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference34 articles.
1. The complexity of G-free colourability;Achlioptas;Discrete Math.,1997
2. On structural parameterizations of the matching cut problem;Aravind,2017
3. H-Free coloring on graphs with bounded tree-width;Aravind,2019
4. Degree-constrained decompositions of graphs: Bounded treewidth and planarity;Bazgan;Theoret. Comput. Sci.,2006
5. The complexity of the matching-cut problem for planar graphs and other graph classes;Bonsma;J. Graph Theory,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献