Complexity of graph covering problems

DOI10.1007/3-540-59071-4_40zbMath1528.68306MaRDI QIDQ6184361

Jan Kratochvíl, Jan Arne Telle, Andrzej Proskurowski

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Computational complexity of covering disconnected multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of H-coloring
• Finite common coverings of pairs of regular graphs
• Finite common coverings of graphs
• Coverings and minors: Application to local computations in graphs
• The NP-Completeness of Edge-Coloring

This page was built for publication: Complexity of graph covering problems