The Complexity of the List Homomorphism Problem for Graphs - Concepedia

Concepedia

Publication | Closed Access

The Complexity of the List Homomorphism Problem for Graphs

25

Citations

24

References

2011

Year

László Egri, Andrei Krokhin, Benoît Larose, Pascal Tesson

Theory of Computing Systems

EngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryList Homomorphism ProblemComputational ComplexityDiscrete MathematicsCombinatorial OptimizationGraph AlgorithmComplexity

References

	Year	Citations

Page 1