When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Nonogram - Wikipedia

    en.wikipedia.org/wiki/Nonogram

    If it is marked "0" those squares are all blank. Maze-a-Pix uses a maze in a standard grid. When the single correct route from beginning to end is located, each 'square' of the solution is filled in (alternatively, all non-solution squares are filled in) to create the picture. Tile Paint is another type of picture logic puzzle by Nikoli.

  3. Nine dots puzzle - Wikipedia

    en.wikipedia.org/wiki/Nine_dots_puzzle

    The "nine dots" puzzle. The puzzle asks to link all nine dots using four straight lines or fewer, without lifting the pen. The nine dots puzzle is a mathematical puzzle whose task is to connect nine squarely arranged points with a pen by four (or fewer) straight lines without lifting the pen or retracing any lines.

  4. Mutilated chessboard problem - Wikipedia

    en.wikipedia.org/wiki/Mutilated_chessboard_problem

    A domino placed on the chessboard will always cover one white square and one black square. Therefore, any collection of dominoes placed on the board will cover equal numbers of squares of each color. But any two opposite squares have the same color: both black or both white. If they are removed, there will be fewer squares of that color and ...

  5. List coloring - Wikipedia

    en.wikipedia.org/wiki/List_coloring

    For a graph G, let χ(G) denote the chromatic number and Δ(G) the maximum degree of G.The list coloring number ch(G) satisfies the following properties.. ch(G) ≥ χ(G).A k-list-colorable graph must in particular have a list coloring when every vertex is assigned the same list of k colors, which corresponds to a usual k-coloring.

  6. Graph power - Wikipedia

    en.wikipedia.org/wiki/Graph_power

    K 4 as the half-square of a cube graph. The half-square of a bipartite graph G is the subgraph of G 2 induced by one side of the bipartition of G. Map graphs are the half-squares of planar graphs, [18] and halved cube graphs are the half-squares of hypercube graphs. [19] Leaf powers are the subgraphs of powers of trees induced by the leaves of ...

  7. Square pyramidal number - Wikipedia

    en.wikipedia.org/wiki/Square_pyramidal_number

    The number of 1 × 1 squares in the grid is n 2. The number of 2 × 2 squares in the grid is (n − 1) 2. These can be counted by counting all of the possible upper-left corners of 2 × 2 squares. The number of k × k squares (1 ≤ k ≤ n) in the grid is (n − k + 1) 2. These can be counted by counting all of the possible upper-left corners ...

  8. Mathematics of paper folding - Wikipedia

    en.wikipedia.org/wiki/Mathematics_of_paper_folding

    The napkin folding problem is the problem of whether a square or rectangle of paper can be folded so the perimeter of the flat figure is greater than that of the original square. The placement of a point on a curved fold in the pattern may require the solution of elliptic integrals.

  9. Commutative diagram - Wikipedia

    en.wikipedia.org/wiki/Commutative_diagram

    In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the same result. [1] It is said that commutative diagrams play the role in category theory that equations play in algebra. [2]