Sciweavers

30 search results - page 1 / 6
» Homomorphisms and Polynomial Invariants of Graphs
Sort
View
ENDM
2007
89views more  ENDM 2007»
13 years 4 months ago
Homomorphisms and Polynomial Invariants of Graphs
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
Delia Garijo, Jaroslav Nesetril, M. P. Revuelta
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 5 months ago
Dichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
Tomás Feder, Pavol Hell, David G. Schell, J...
CSR
2008
Springer
13 years 6 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
LICS
2000
IEEE
13 years 9 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 3 months ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey