Conflict free version of covering problems on graphs: classical and parameterized

DOI10.1007/s00224-019-09964-6zbMath1453.68136MaRDI QIDQ5918906

Pranabendu Misra, Pallavi Jain, Lawqueen Kanesh

Publication date: 26 August 2020

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-019-09964-6

zbMATH Keywords

hereditary properties; vertex cover; parameterized algorithms; kernelization; conflict-freeness

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q27: Parameterized complexity, tractability and kernelization