The work defines and compares structural properties (cores, gaps, universality, finite dualities) across nine constrained homomorphism orders on graphs, identifying cores and gap witnesses for full, surjective, and locally injective cases.
In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constrained homomorphism orders
The work defines and compares structural properties (cores, gaps, universality, finite dualities) across nine constrained homomorphism orders on graphs, identifying cores and gap witnesses for full, surjective, and locally injective cases.