Plans on strong hypergraph colouring (all vertices in any hyperedges get different colours)
More...
Go to the source code of this file.
Detailed Description
Plans on strong hypergraph colouring (all vertices in any hyperedges get different colours)
 Todo:
 InjectivityConstraints:

Given a hypergraph G, the most natural way of handling the strong kcolouring problem for G is to use for every hyperedge H an injectivity constraint resp. a bijectivity constraint in case H = k. See module InjectivityConstraints.

The question is, whether something special can be done here?
 Todo:
 Graph colouring conversion

Of course, the strong hypergraph colouring problem for G is the same as the graph colouring problem for G_{[2]} (the 2section of G).

For longer hyperedges the hypergraph treatment should be superior.

What is the boundary for hyperedge sizes? Can for example 3hyperedges be efficiently translated into 3 2edges? It seems quite sure that only for a certain minimal hyperedge length the additional effort for strong treatment of injectivity constraint is vindicated.
Definition in file StrongColouring.hpp.