Title
Forbidden Pairs Combinatorics
Abstract
We define a formalism, forbidden pairs problems, in which many combinatorial constructions can be expressed. The formalism highlights the basic nature of a large number of combinatorial constraints. We also define an algebraic-arithmetic problem to which all forbidden pairs problems can be PTIME reduced.
Publication Date
12-1-2000
Publication Title
Australasian Journal of Combinatorics
Volume
22
Number of Pages
91-99
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
84885945500 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/84885945500
STARS Citation
Litow, B. and Deo, Narsingh, "Forbidden Pairs Combinatorics" (2000). Scopus Export 2000s. 640.
https://stars.library.ucf.edu/scopus2000/640
COinS