Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference32 articles.
1. Björklund A, Husfeldt T, Koivisto M (2009) Set partitioning via inclusion–exclusion. SIAM J Comput 39(2):546–563
2. Bodlaender HL, Jansen BMP, Kratsch S (2014) Kernelization lower bounds by cross-composition. SIAM J Discrete Math 28(1):277–305
3. Bonomo F, Durán G, Marenco J (2008) Exploring the complexity boundary between coloring and list-coloring. Ann Oper Res 169(1):3–16
4. Bonsma PS, Mouawad AE, Nishimura N, Raman V (2014) The complexity of bounded length graph recoloring and CSP reconfiguration. In: Proceedings of the 9th international symposium on parameterized and exact computation, IPEC 2014, Wroclaw, 10-12 Sept, pp 110–121
5. Clark SA, Holliday JE, Holliday SH, Johnson P, Trimm JE, Rubalcaba RR, Walsh M (2006) Chromatic villainy in graphs. Congressus Numerantium 182:171
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Grundy Distinguishes Treewidth from Pathwidth;SIAM Journal on Discrete Mathematics;2022-07-28