scientific article; zbMATH DE number 2080268

zbMath1044.68129MaRDI QIDQ4472519

Petter Kristiansen, Jan Arne Telle

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690456.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (17)

Computing role assignments of split graphs ⋮ 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 ⋮ Comparing Universal Covers in Polynomial Time ⋮ List covering of regular multigraphs with semi-edges ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Packing bipartite graphs with covers of complete bipartite graphs ⋮ 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 ⋮ Comparing universal covers in polynomial time ⋮ Fall colouring of bipartite graphs and Cartesian products of graphs ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree ⋮ A complete complexity classification of the role assignment problem

This page was built for publication: