ExLibris header image
SFX Logo
Title: Counting k-projections of a point set
Source:

Journal of Combinatorial Theory Series A [0097-3165] Skiena, Steven yr:1990


Collapse list of basic services Basic
Full text
Full text available via EZB-NALI5-00465 Elsevier Archive NL
GO
Document delivery
Request document via Library/Bibliothek GO
Users interested in this article also expressed an interest in the following:
1. "Computational discrete mathematics: combinatorics and graph theory with Mathematica." CHOICE: Current Reviews for Academic Libraries 42.01 (2004): 42-42. Link to SFX for this item
2. Simonelli, I. "Optimal graphs for chromatic polynomials." Discrete mathematics 308.11 (2008): 2228-2239. Link to SFX for this item
3. Knuth, Donald E. "Problems and Solutions: Solutions: A Parity Problem in Combinatorial Enumeration: 10546." The American mathematical monthly 105.9 (1998): 867-868. Link to SFX for this item
4. Wang, Lily i. "On the log-convexity of combinatorial sequences." Advances in applied mathematics 39.4 (2007): 453-476. Link to SFX for this item
5. Loebl, M. "Chromatic polynomial, $q$-binomial counting and colored Jones function." Advances in mathematics 211.2 (2007): 546-565. Link to SFX for this item
6. Knuth, Donald E. "Problems and Solutions: Problems: 10691." The American mathematical monthly 105.9 (1998): 859-. Link to SFX for this item
7. Herzberg, Agnes M. "Sudoku squares and chromatic polynomials." Notices of the American Mathematical Society 54.6 (2007): 708-717. Link to SFX for this item
8. Knuth, Donald E. "Problems and Solutions: Solutions: Minimal Special Matrices: 10470." The American mathematical monthly 105.8 (1998): 771-773. Link to SFX for this item
Select All Clear All

Expand list of advanced services Advanced
A service provided by the Library of the Wissenschaftspark Albert Einstein, Potsdam, Germany.
© 2005 SFX by Ex Libris Inc.