scientific article; zbMATH DE number 1107736
From MaRDI portal
Publication:4373685
zbMath0890.68095MaRDI QIDQ4373685
Jan Kratochvíl, Jan Arne Telle, Andrzej Proskurowski
Publication date: 11 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Computational complexity of covering disconnected multigraphs ⋮ Cantor--Bernstein type theorem for locally constrained graph homomorphisms ⋮ Mixed hypergraphs and other coloring problems ⋮ List covering of regular multigraphs ⋮ Graph covers: where topology meets computer science, and simple means difficult ⋮ List covering of regular multigraphs with semi-edges ⋮ Computational complexity of covering three-vertex multigraphs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Complexity of Locally Injective Homomorphism to the Theta Graphs ⋮ Locally Injective Homomorphism to the Simple Weight Graphs ⋮ On the computational complexity of partial covers of theta graphs ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ Comparing universal covers in polynomial time
