[BOOK][B] Handbook of product graphs

RH Hammack, W Imrich, S Klavžar, W Imrich, S Klavžar - 2011 - api.taylorfrancis.com
Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …

[BOOK][B] Graph coloring problems

TR Jensen, B Toft - 2011 - books.google.com
Contains a wealth of information previously scattered in research journals, conference
proceedings and technical reports. Identifies more than 200 unsolved problems. Every …

[BOOK][B] Graphs and homomorphisms

P Hell, J Nesetril - 2004 - books.google.com
This is a book about graph homomorphisms. Graph theory is now an established discipline
but the study of graph homomorphisms has only recently begun to gain wide acceptance …

On the complexity of H-coloring

P Hell, J Nešetřil - Journal of Combinatorial Theory, Series B, 1990 - Elsevier
Let H be a fixed graph, whose vertices are referred to as 'colors'. An H-coloring of a graph G
is an assignment of 'colors' to the vertices of G such that adjacent vertices of G obtain …

[BOOK][B] Algebraic theory of quasivarieties

VA Gorbunov - 1998 - books.google.com
The theory of quasivarieties constitutes an independent direction in algebra and
mathematical logic and specializes in a fragment of first-order logic-the so-called universal …

The core of a graph

P Hell, J Nešetřil - Discrete Mathematics, 1992 - Elsevier
The core of a graph is its smallest subgraph which also is a homomorphic image. It turns out
the core of a finite graph is unique (up to isomorphism) and is also its smallest retract. We …

A survey on Hedetniemi's conjecture

X Zhu - Taiwanese Journal of Mathematics, 1998 - projecteuclid.org
More than 30 years ago, Hedetniemi made a conjecture which says that the categorical
product of two n-chromatic graphs is still n-chromatic. The conjecture is still open, despite …

Colouring, constraint satisfaction, and complexity

P Hell, J Nešetřil - Computer Science Review, 2008 - Elsevier
Constraint satisfaction problems have enjoyed much attention since the early seventies, and
in the last decade have become also a focus of attention amongst theoreticians. Graph …

Duality theorems for finite structures (characterising gaps and good characterisations)

J Nešetřil, C Tardif - Journal of Combinatorial Theory, Series B, 2000 - Elsevier
We provide a correspondence between the subjects of duality and density in classes of finite
relational structures. The purpose of duality is to characterise the structures C that do not …

Sparsity

J Nešetřil, PO de Mendez - Algorithms and Combinatorics, 2012 - Springer
This text is aimed at doctoral students and researchers, who are interested in Combinatorics
and Graph Theory or who would just like to learn about some active topics and trends. But …