# Category:Mathematics articles related to discrete mathematics

Jump to navigation
Jump to search
(previous page) (next page)

This content was retrieved from
Wikipedia : http://en.wikipedia.org/wiki/Category:Mathematics_articles_related_to_discrete_mathematicsThis category is for the talk pages of mathematics articles whose field is related to discrete mathematics. It is automatically populated by the {{maths rating}} template, via the `field` parameter.

## Pages in category "Mathematics articles related to discrete mathematics"

The following 200 pages are in this category, out of approximately 1,305 total. This list may not reflect recent changes (learn more).

(previous page) (next page)### ♯

### 0–9

### A

- Talk:A* search algorithm
- Talk:Aanderaa–Karp–Rosenberg conjecture
- Talk:AC (complexity)
- Talk:AC0
- Talk:ACC0
- Talk:Addition-chain exponentiation
- Talk:Adjacency algebra
- Talk:Adjacency list
- Talk:Advice (complexity)
- Talk:Agreement forest
- Talk:Algebraic combinatorics
- Talk:Algebraic connectivity
- Talk:Algebraic graph theory
- Talk:Algorithm design
- Talk:Algorithmic game theory
- Talk:Algorithmic version for Szemerédi regularity partition
- Talk:Alias method
- Talk:ALL (complexity)
- Talk:Alpha centrality
- Talk:Alpha–beta pruning
- Talk:Alphabet (formal languages)
- Talk:Amnestic functor
- Talk:Amortized analysis
- Talk:Andrásfai graph
- Talk:Angular resolution (graph drawing)
- Talk:Antichain
- Talk:Antimatroid
- Talk:Anytime A*
- Talk:Aperiodic finite state automaton
- Talk:Aperiodic graph
- Talk:Apex graph
- Talk:Apollonian network
- Talk:Apply
- Talk:Approximation algorithm
- Talk:APX
- Talk:Arborescence (graph theory)
- Talk:Arboricity
- Talk:Arc diagram
- Talk:Archimedean graph
- Talk:Arden's Rule
- Talk:Area (graph drawing)
- Talk:Arrow's impossibility theorem
- Talk:Art gallery problem
- Talk:Arthur–Merlin protocol
- Talk:Assignment problem
- Talk:Asymptotic computational complexity
- Talk:Attack model
- Talk:Automatic sequence
- Talk:Averaging argument
- Talk:AWPP (complexity)

### B

- Talk:B*
- Talk:Balaban 10-cage
- Talk:Balaban 11-cage
- Talk:Balanced boolean function
- Talk:Balanced code
- Talk:Balanced matrix
- Talk:Baranyai's theorem
- Talk:Barrett reduction
- Talk:Barycentric subdivision
- Talk:Barycentric-sum problem
- Talk:Basic solution (linear programming)
- Talk:Baum–Sweet sequence
- Talk:Baxter permutation
- Talk:BCJR algorithm
- Talk:Bell number
- Talk:Bell polynomials
- Talk:Bellman–Ford algorithm
- Talk:Bend minimization
- Talk:Bent function
- Talk:Berlekamp–Welch algorithm
- Talk:Bertrand's ballot theorem
- Talk:Best response
- Talk:BEST theorem
- Talk:Best, worst and average case
- Talk:Better-quasi-ordering
- Talk:Betweenness centrality
- Talk:Biased graph
- Talk:Biased random walk on a graph
- Talk:Bicircular matroid
- Talk:Biconnected component
- Talk:Biconnected graph
- Talk:Bidiakis cube
- Talk:Bidirected graph
- Talk:Bidirectional search
- Talk:Biggs–Smith graph
- Talk:Biham–Middleton–Levine traffic model
- Talk:Bimagic cube
- Talk:Binary Golay code
- Talk:Binary matroid
- Talk:Binary tree
- Talk:Binomial transform
- Talk:Biot–Tolstoy–Medwin diffraction model
- Talk:Bipartite dimension
- Talk:Bipartite double cover
- Talk:Bipartite graph
- Talk:Bipartite matroid
- Talk:Bipolar orientation
- Talk:Biregular graph
- Talk:Birkhoff's representation theorem
- Talk:Bitwise operation
- Talk:Bivariegated graph
- Talk:Blahut–Arimoto algorithm
- Talk:Blanuša snarks
- Talk:Block design
- Talk:Block graph
- Talk:Block walking
- Talk:Blossom algorithm
- Talk:Blossom tree (graph theory)
- Talk:Blum axioms
- Talk:Blum's speedup theorem
- Talk:Böhm tree
- Talk:Bollobás–Riordan polynomial
- Talk:Bondy's theorem
- Talk:Book (graph theory)
- Talk:Book embedding
- Talk:Boole's expansion theorem
- Talk:Boolean circuit
- Talk:Boolean differential calculus
- Talk:Boolean satisfiability problem
- Talk:Borůvka's algorithm
- Talk:Boxicity
- Talk:BPL (complexity)
- Talk:BPP (complexity)
- Talk:BQP
- Talk:Braess's paradox
- Talk:Braided monoidal category
- Talk:Bramble (graph theory)
- Talk:Brams–Taylor procedure
- Talk:Branch-decomposition
- Talk:Branching factor
- Talk:Bratteli diagram
- Talk:Breadth-first search
- Talk:Bridge (graph theory)
- Talk:Brinkmann graph
- Talk:Brouwer–Haemers graph
- Talk:Bruck–Ryser–Chowla theorem
- Talk:Bull graph
- Talk:Burst error-correcting code
- Talk:Butterfly graph

### C

- Talk:Cactus graph
- Talk:Cage (graph theory)
- Talk:Cake number
- Talk:Calkin–Wilf tree
- Talk:Cameron graph
- Talk:Cameron–Erdős conjecture
- Talk:Canadian traveller problem
- Talk:Capacitated minimum spanning tree
- Talk:Cartesian product of graphs
- Talk:Catalan number
- Talk:Catalan's constant
- Talk:Catalan's triangle
- Talk:Caterpillar tree
- Talk:Cayley's formula
- Talk:Cayley's mousetrap
- Talk:CC (complexity)
- Talk:CC system
- Talk:Center (category theory)
- Talk:Centered set
- Talk:Centered tree
- Talk:Centrality
- Talk:Certificate (complexity)
- Talk:Chain code
- Talk:Chaitin's constant
- Talk:Chang graphs
- Talk:Change-making problem
- Talk:Cheeger constant (graph theory)
- Talk:Cheung–Marks theorem
- Talk:Chomsky–Schützenberger enumeration theorem
- Talk:Chomsky–Schützenberger representation theorem
- Talk:Chordal bipartite graph
- Talk:Chordal graph
- Talk:Christofides algorithm
- Talk:Chromatic polynomial
- Talk:Church–Turing–Deutsch principle
- Talk:Chvátal graph
- Talk:Circle graph
- Talk:Circuit complexity
- Talk:Circuit minimization for Boolean functions
- Talk:Circuit rank
- Talk:Circuit satisfiability problem
- Talk:Circulant graph
- Talk:Circular coloring
- Talk:Circular layout
- Talk:Circular shift
- Talk:Claw-free graph
- Talk:Clebsch graph
- Talk:Clique (graph theory)
- Talk:Clique complex
- Talk:Clique cover

This page is based on the copyrighted Wikipedia article "Category:Mathematics articles related to discrete mathematics"; it is used under the Creative Commons
Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may
redistribute it, verbatim or modified, providing that you comply with
the terms of the CC-BY-SA