Dichotomy of the H-quasi-cover problem

DOI10.1007/978-3-642-38536-0_27zbMATH Open1381.68097OpenAlexW2249342429MaRDI QIDQ4928495FDOQ4928495

Authors: Jiří Fiala, Marek Tesař 

Publication date: 14 June 2013

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_27

Recommendations

• scientific article; zbMATH DE number 1236360
• Covering regular graphs
• On the complexity of planar covering of small graphs
• \(K_ i\)-covers. I: Complexity and polytopes
• scientific article; zbMATH DE number 1107736

zbMATH Keywords

computational complexitydichotomygraph cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• An algorithmic framework for locally constrained homomorphisms
• An algorithmic framework for locally constrained homomorphisms

This page was built for publication: Dichotomy of the \(H\)-quasi-cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928495)