Sciweavers

150 search results - page 1 / 30
» Polynomial graph invariants from homomorphism numbers
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
TOMS
2010
106views more  TOMS 2010»
13 years 2 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
ICALP
2009
Springer
14 years 4 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
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
JGT
2008
97views more  JGT 2008»
13 years 4 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena