The following pages link to Journal of Combinatorial Theory
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Borsuk–Ulam theorem (links | edit)
- P versus NP problem (links | edit)
- Expander graph (links | edit)
- Phylogenetics (links | edit)
- Steiner system (links | edit)
- Gray code (links | edit)
- W. T. Tutte (links | edit)
- EXPTIME (links | edit)
- Squaring the square (links | edit)
- Integer partition (links | edit)
- Tree decomposition (links | edit)
- Combinatorial species (links | edit)
- Computational geometry (links | edit)
- List of unsolved problems in mathematics (links | edit)
- Ramsey's theorem (links | edit)
- Petersen graph (links | edit)
- Bell number (links | edit)
- Umbral calculus (links | edit)
- Ronald Graham (links | edit)
- Matroid (links | edit)
- Hamiltonian path (links | edit)
- Component (graph theory) (links | edit)
- Clique problem (links | edit)
- Shannon switching game (links | edit)
- Orbifold (links | edit)
- Erdős–Ko–Rado theorem (links | edit)
- Shing-Tung Yau (links | edit)
- Ehrhart polynomial (links | edit)
- Tessellation (links | edit)
- List of conjectures by Paul Erdős (links | edit)
- Outerplanar graph (links | edit)
- Graph minor (links | edit)
- Dickson's lemma (links | edit)
- Kissing number (links | edit)
- Graph coloring (links | edit)
- Sperner's lemma (links | edit)
- Edge-transitive graph (links | edit)
- Nerve complex (links | edit)
- Szemerédi's theorem (links | edit)
- Unimodular matrix (links | edit)
- Antimatroid (links | edit)
- Perfect graph (links | edit)
- Perfect graph theorem (links | edit)
- Line graph (links | edit)
- Uniquely colorable graph (links | edit)
- Graph homomorphism (links | edit)
- Critical graph (links | edit)
- Matrix of ones (links | edit)
- Edge coloring (links | edit)
- List edge-coloring (links | edit)