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, Adam¹ (AUTHOR) ajaffe@uwaterloo.ca
Source:	Graphs & Combinatorics. Nov2021, Vol. 37 Issue 6, p2459-2466. 8p.
Database:	Academic Search Ultimate

Description
ISSN:	09110119
DOI:	10.1007/s00373-021-02367-w