colorable
51Wolfgang Haken — (* 21. Juni 1928 in Berlin) ist ein deutsch amerikanischer Mathematiker mit dem Spezialgebiet Topologie (insbesondere 3 dimensionale Mannigfaltigkeiten), der mit Kenneth Appel 1976 das Vierfarbenproblem löste. Inhaltsverzeichnis 1 Leben und Werk… …
52HÉTÉROPYCNOSE — Portion ou totalité d’un chromosome, qui se trouve dotée, dans une espèce donnée, de façon régulière, d’une colorabilité (aux colorations cytologiques nucléales, comme celle de Feulgen) différente de celle du restant du lot chromosomique, soit… …
53Frivolous litigation — Tort law Part of the …
54Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …
55Plastic — is the general common term for a wide range of synthetic or semisynthetic organic solid materials suitable for the manufacture of industrial products. Plastics are typically polymers of high molecular weight, and may contain other substances to… …
56Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician …
57Open problem — Open question redirects here. For information on open ended questions, see closed ended question. In science and mathematics, an open problem or an open question is a known problem that can be accurately stated, and has not yet been solved (no… …
58Discharging method (discrete mathematics) — The discharging method is a technique used to prove lemmas in structural graph theory. Discharging is most well known for its central role in the proof of the Four Color Theorem. The discharging method is used to prove that every graph in a… …
59Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? …
60De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …
