scientific article; zbMATH DE number 1236360
From MaRDI portal
Publication:4223772
zbMath0911.68076MaRDI QIDQ4223772
Jan Arne Telle, Andrzej Proskurowski, Jan Kratochvíl
Publication date: 19 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (21)
Cantor--Bernstein type theorem for locally constrained graph homomorphisms ⋮ Mixed hypergraphs and other coloring problems ⋮ List covering of regular multigraphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ List covering of regular multigraphs with semi-edges ⋮ Computational complexity of covering three-vertex multigraphs ⋮ Loose cover of graphs ⋮ Packing bipartite graphs with covers of complete bipartite graphs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Labelled (Hyper)Graphs, Negotiations and the Naming Problem ⋮ Complexity of Locally Injective Homomorphism to the Theta Graphs ⋮ Locally Injective Homomorphism to the Simple Weight Graphs ⋮ Block transitivity and degree matrices ⋮ On the computational complexity of partial covers of theta graphs ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ A branch-and-cut algorithm for the maximum covering cycle problem ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ Approximate lumpability for Markovian agent-based models using local symmetries ⋮ On the Complexity of Planar Covering of Small Graphs ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
This page was built for publication:
