scientific article
From MaRDI portal
Publication:3802605
zbMath0655.68039MaRDI QIDQ3802605
Jan Kratochvíl, Mirko Křivánek
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Combinatorial codes (94B25)
Related Items (11)
Regular codes in regular graphs are difficult ⋮ Structural parameterization for minimum conflict-free colouring ⋮ Finding Consensus Strings with Small Length Difference Between Input and Solution Strings ⋮ A generalization of Lee codes ⋮ Lattice-like total perfect codes ⋮ Compatible 2-factors ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Parameterized complexity of minimum membership dominating set ⋮ On the Complexity of Solving Restricted Word Equations ⋮ Pattern matching with variables: a multivariate complexity analysis ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
This page was built for publication:
