Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts.

Saved in:
Bibliographic Details
Title: Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts.
Authors: Jaffe, Adam1 (AUTHOR) ajaffe@uwaterloo.ca
Source: Graphs & Combinatorics. Nov2021, Vol. 37 Issue 6, p2459-2466. 8p.
Database: Academic Search Ultimate
Be the first to leave a comment!
You must be logged in first