scientific article; zbMATH DE number 2080268

MaRDI QIDQ4472519zbMATH OpenFDO

Authors 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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2156263
• scientific article; zbMATH DE number 2111730
• scientific article; zbMATH DE number 1953094
• scientific article; zbMATH DE number 1151810
• The restrictive \(H\)-coloring problem

Cited in

(27)

• Fall colouring of bipartite graphs and Cartesian products of graphs
• List covering of regular multigraphs
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
• Locally constrained graph homomorphisms and equitable partitions
• Packing bipartite graphs with covers of complete bipartite graphs
• On the computational complexity of partial covers of theta graphs
• Computing role assignments of split graphs
• Complexity of locally injective homomorphism to the Theta graphs
• Locally injective homomorphism to the simple weight graphs
• Comparing Universal Covers in Polynomial Time
• scientific article; zbMATH DE number 1052826 (Why is no real title available?)
• scientific article; zbMATH DE number 1953094 (Why is no real title available?)
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Structure Learning of H-colorings
• scientific article; zbMATH DE number 2156263 (Why is no real title available?)
• scientific article; zbMATH DE number 2111730 (Why is no real title available?)
• Surjective H-Colouring over Reflexive Digraphs
• An algorithmic framework for locally constrained homomorphisms
• List covering of regular multigraphs with semi-edges
• An algorithmic framework for locally constrained homomorphisms
• Computational complexity of covering multigraphs with semi-edges: small cases
• Computational complexity of covering regular trees
• Häggkvist-Hell graphs: A class of Kneser-colorable graphs
• A complete complexity classification of the role assignment problem
• Cantor--Bernstein type theorem for locally constrained graph homomorphisms
• Mixed hypergraphs and other coloring problems
• Comparing universal covers in polynomial time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472519)