The following pages link to Discrete Mathematics (journal)
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Cube (links | edit)
- Discrete mathematics (links | edit)
- Dual polyhedron (links | edit)
- Four color theorem (links | edit)
- Polyhedron (links | edit)
- Tesseract (links | edit)
- Latin square (links | edit)
- Möbius strip (links | edit)
- Wang tile (links | edit)
- Squaring the square (links | edit)
- Polyomino (links | edit)
- Julius Petersen (links | edit)
- Tomaž Pisanski (links | edit)
- Kite (geometry) (links | edit)
- Equilateral triangle (links | edit)
- List of unsolved problems in mathematics (links | edit)
- Hermite polynomials (links | edit)
- Borůvka's algorithm (links | edit)
- Ronald Graham (links | edit)
- Bipartite graph (links | edit)
- Component (graph theory) (links | edit)
- Clique problem (links | edit)
- Shannon switching game (links | edit)
- Double counting (proof technique) (links | edit)
- Tessellation (links | edit)
- Outline of combinatorics (links | edit)
- Outerplanar graph (links | edit)
- Turán graph (links | edit)
- Interval graph (links | edit)
- Magic hypercube (links | edit)
- Graph coloring (links | edit)
- 1926 in science (links | edit)
- Pancake sorting (links | edit)
- 2-satisfiability (links | edit)
- 600-cell (links | edit)
- Perfect graph (links | edit)
- Perfect graph theorem (links | edit)
- Line graph (links | edit)
- Uniquely colorable graph (links | edit)
- Graph homomorphism (links | edit)
- Edge coloring (links | edit)
- List coloring (links | edit)
- Acyclic coloring (links | edit)
- Noncrossing partition (links | edit)
- Subcoloring (links | edit)
- Snark (graph theory) (links | edit)
- Meyniel graph (links | edit)
- Strong perfect graph theorem (links | edit)
- Dilworth's theorem (links | edit)
- Motzkin number (links | edit)