Wikipedia:WikiProject Mathematics/Wikipedia 1.0/Discrete mathematics/Low

From Wikipedia, the free encyclopedia



This page lists low priority articles that have been assigned to the field Discrete mathematics using the {{maths rating}} template. To include articles on this page, use the following wiki code (in which newlines are optional).

{{maths rating
  |class = quality grading (FA, A, GA, Bplus, B, Start, or Stub)
  |importance = Low
  |field = Discrete mathematics
}}

[edit] Description

This field is for articles concerning the more combinatorial, computational, finite, or constructive aspects of mathematics, including:

combinatorics, algorithms and theoretical computer science.

Some articles in these areas might instead be rated under algebra or applied, depending on their content.

For a list of, or links to, all articles in this field, see Wikipedia:WikiProject Mathematics/Wikipedia 1.0/Discrete mathematics.

The articles are listed in a table below, which is updated automatically by VeblenBot.

Article Grade Comments
  Pseudoforest (talk) A-Good article GA
  Discharging method (discrete mathematics) (talk) B
  Erdős–Szekeres theorem (talk) B
  Fair division (talk) B
  Grötzsch graph (talk) B
  Happy Ending problem (talk) B
  Heawood graph (talk) B
  Polyomino (talk) B
  Alabama paradox (talk) Start
  Aperiodic graph (talk) Start
  Assignment problem (talk) Start
  Cartesian product of graphs (talk) Start
  Catalan's constant (talk) Start
  Cayley's formula (talk) Start
  Collaboration graph (talk) Start
  Combinatorial proof (talk) Start
  Cube-connected cycles (talk) Start
  Cycle index (talk) Start
  Cycles and fixed points (talk) Start
  DFT matrix (talk) Start
  De Bruijn graph (talk) Start
  De Bruijn sequence (talk) Start
  Delannoy number (talk) Start
  Delaunay triangulation (talk) Start
  Difference set (talk) Start
  Distance-regular graph (talk) Start
  Dowling geometry (talk) Start
  Edge-graceful labeling (talk) Start
  Helly family (talk) Start
  Hexomino (talk) Start
  Kirkman's schoolgirl problem (talk) Start
  Klee's measure problem (talk) Start
  Kneser graph (talk) Start
  Knight's tour (talk) Start
  Kruskal's algorithm (talk) Start
  Mathematics of Sudoku (talk) Start
  Multiple edges (talk) Start
  Möbius–Kantor graph (talk) Start
  Narayana number (talk) Start
  Network topology (talk) Start
  Pentomino (talk) Start
  Polyform (talk) Start
  Polyiamond (talk) Start
  Problems in Latin squares (talk) Start
  Random regular graph (talk) Start
  Schröder number (talk) Start
  Thue-Morse sequence (talk) Start
  Automatic group (talk) Stub
  Biadjacency matrix (talk) Stub
  Bidirected graph (talk) Stub
  Book (graph theory) (talk) Stub
  Bridge (graph theory) (talk) Stub
  Bridge number (talk) Stub
  Cactus graph (talk) Stub
  Combinatorial class (talk) Stub
  Combinatorial enumeration (talk) Stub
  Combinatorial explosion (talk) Stub
  Connected component (graph theory) (talk) Stub
  Covering (graph theory) (talk) Stub
  Critical graph (talk) Stub
  Cubic graph (talk) Stub
  Cycle graph (talk) Stub
  Cycle space (talk) Stub
  Cyclically reduced word (talk) Stub
  Davis–Putnam algorithm (talk) Stub
  Degree (graph theory) (talk) Stub
  Degree distribution (talk) Stub
  Dense graph (talk) Stub
  Dickson's lemma (talk) Stub
  Disperser (talk) Stub
  Distance-transitive graph (talk) Stub
  Domatic number (talk) Stub
  Domino problem (talk) Stub
  Dual code (talk) Stub
  Erdős–Stone theorem (talk) Stub
  Factorion (talk) Stub
  Information set (game theory) (talk) Stub
  K-core (talk) Stub
  Kautz graph (talk) Stub
  Kendall tau distance (talk) Stub
  Kirchhoff's theorem (talk) Stub
  List coloring (talk) Stub
  Polyabolo (talk) Stub
  Polycube (talk) Stub
  Polydrafter (talk) Stub
  Polyhex (mathematics) (talk) Stub
  Road coloring problem (talk) Stub
  Rook's graph (talk) Stub
  Strongly connected component (talk) Stub
  Szekeres snark (talk) Stub
  Tait's conjecture (talk) Stub
  Tromino (talk) Stub
Last updated: Fri Jun 13 01:10:02 UTC 2008