Structural Parameterization for Minimum Conflict-Free Colouring
Discrete Applied Mathematics（2022）
Key words
Conflict-free colouring of graphs,Parameterized complexity,FPT algorithms,Treewidth,Exponential Time Hypothesis,Strong Exponential Time Hypothesis,Vertex cover,Kernelization
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined