Try to exclude edge sets

[julian0804]

If a specific set of edges or a mapping equals zero to a certain point in the computing process, we do not have to look at this entry ever again.

• All mappings extending this one in the later computation will also equal zero.
• All graphs containing this set of edges as a subset will also have no homomorphism to G

Try some sort of blocking certain sets of edges or certain mappings
-> I guess only the first one would have some benefit in computing
-> How to behave with branches

• some simple idea would be to remember the edge sets equal zero and at the end just generate rest of graphs
• But how could we check that this forbidden entries will not be used.

=> This would equal some branch an bound method were we cut a branch (set of edges) if the corresponding entries for all mappings equal zero