Matches in Harvard for { <http://id.lib.harvard.edu/aleph/005192010/catalog> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- catalog contributor b7334022.
- catalog created "c1995.".
- catalog date "1995".
- catalog date "c1995.".
- catalog dateCopyrighted "c1995.".
- catalog description "1. Elements of graph theory -- 2. Covering circuits and graph coloring -- 3. Trees and searching -- 4. Network algorithms -- 5. Generating counting methods for selections and arrangements -- 6. Generating functions -- 7. Recurrence relations -- 8. Inclusion-exclusion -- 9. Polya's enumeration formula -- 10. Games with graphs -- App. 1. Set theory and logic -- App. 2. Mathematical induction -- App. 3. A little probability -- App. 4. The pigeonhole principle.".
- catalog description "Includes bibliographical references (p. 429-430) and index.".
- catalog extent "ix, 462 p. :".
- catalog hasFormat "Applied combinatorics.".
- catalog identifier "0471595047 (acid-free paper)".
- catalog isFormatOf "Applied combinatorics.".
- catalog issued "1995".
- catalog issued "c1995.".
- catalog language "eng".
- catalog publisher "New York : Wiley & Sons,".
- catalog relation "Applied combinatorics.".
- catalog subject "511/.6 20".
- catalog subject "Combinatorial analysis.".
- catalog subject "Graph theory.".
- catalog subject "QA164 .T83 1995".
- catalog tableOfContents "1. Elements of graph theory -- 2. Covering circuits and graph coloring -- 3. Trees and searching -- 4. Network algorithms -- 5. Generating counting methods for selections and arrangements -- 6. Generating functions -- 7. Recurrence relations -- 8. Inclusion-exclusion -- 9. Polya's enumeration formula -- 10. Games with graphs -- App. 1. Set theory and logic -- App. 2. Mathematical induction -- App. 3. A little probability -- App. 4. The pigeonhole principle.".
- catalog title "Applied combinatorics / Alan Tucker.".
- catalog type "text".