69 search results - page 12 / 14 » ejc 2008 |
114
click to vote
EJC
2008
15 years 2 hour ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
117
Voted
EJC
2008
15 years 2 hour ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
102
click to vote
EJC
2008
15 years 2 hour ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
100
click to vote
EJC
2008
15 years 2 hour ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
108
click to vote
EJC
2008
15 years 2 hour ago
2008
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...