Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008768574/catalog> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- catalog contributor b12289736.
- catalog contributor b12289737.
- catalog contributor b12289738.
- catalog created "c2002.".
- catalog date "2002".
- catalog date "c2002.".
- catalog dateCopyrighted "c2002.".
- catalog description "Elements of graph theory -- Covering circuits and graph coloring -- Trees and searching -- Network algorithms -- Generating counting methods for selections and arrangements -- Generating functions -- Recurrence relations -- Inclusion-exclusion -- Polya's enumeration formula -- Games with graphs -- Appendix 1: Set theory and logic -- Appendix 2: Mathematical induction -- Appendix 3: A little probability -- Appendix 4: The pigeonhole principle -- Glossary of counting and graph theory terms.".
- catalog description "Includes bibliographical references and index.".
- catalog extent "ix, 446 p. :".
- catalog hasFormat "Applied combinatorics.".
- catalog identifier "047143809X (cloth : alk. paper)".
- catalog isFormatOf "Applied combinatorics.".
- catalog issued "2002".
- catalog issued "c2002.".
- catalog language "eng".
- catalog publisher "New York : John Wiley & Sons,".
- catalog relation "Applied combinatorics.".
- catalog subject "511/.6 21".
- catalog subject "Combinatorial analysis.".
- catalog subject "Graph theory.".
- catalog subject "QA164 .T83 2002".
- catalog tableOfContents "Elements of graph theory -- Covering circuits and graph coloring -- Trees and searching -- Network algorithms -- Generating counting methods for selections and arrangements -- Generating functions -- Recurrence relations -- Inclusion-exclusion -- Polya's enumeration formula -- Games with graphs -- Appendix 1: Set theory and logic -- Appendix 2: Mathematical induction -- Appendix 3: A little probability -- Appendix 4: The pigeonhole principle -- Glossary of counting and graph theory terms.".
- catalog title "Applied combinatorics / Alan Tucker.".
- catalog type "text".