Forbidden pairs combinatorics

Litow, B., and Deo, Narsingh (2000) Forbidden pairs combinatorics. Australasian Journal of Combinatorics, 22. pp. 91-99.

[img] PDF (Published Version) - Published Version
Restricted to Repository staff only

View at Publisher Website:


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.

Item ID: 12753
Item Type: Article (Research - C1)
ISSN: 1034-4942
Related URLs:
Date Deposited: 17 Jul 2012 02:06
FoR Codes: 08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 100%
SEO Codes: 89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%
Downloads: Total: 2
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page