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.
Locally constrained graph homomorphisms - structure, complexity, and applica- tions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.
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.
-
Unfoldings and coverings of weighted graphs
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.