Find link

language:

Find link is a tool written by Edward Betts.

searching for Map coloring 29 found (44 total)

Map-coloring games (860 words) [view diff] no match in snippet view article find links to article

Several map-coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all

Col (game) (502 words) [view diff] no match in snippet view article

Col is a pencil and paper game, specifically a map-coloring game, involving the shading of areas in a line drawing according to the rules of graph coloring

On Numbers and Games (987 words) [view diff] no match in snippet view article find links to article

mathematically inspired) two-player games, such as nim, hackenbush, and the map-coloring games col and snort. The development includes their scoring, a review

Constraint satisfaction problem (2,604 words) [view diff] exact match in snippet view article find links to article

constraint satisfaction problem include: Type inference Eight queens puzzle Map coloring problem Maximum cut problem Sudoku, crosswords, futoshiki, Kakuro (Cross

Earth–Moon problem (1,845 words) [view diff] exact match in snippet view article find links to article

problem on graph coloring in mathematics. It is an extension of the planar map coloring problem (solved by the four color theorem), and was posed by Gerhard

GeoJSON (704 words) [view diff] exact match in snippet view article find links to article

topology, such as topology-preserving shape simplification, automatic map coloring, and cartograms. A reference implementation of the TopoJSON specification

Decision Model and Notation (1,884 words) [view diff] exact match in snippet view article find links to article

process models, just like DMN. As an example, consider the well-known map coloring or Graph coloring problem. Here, we wish to color a map in such a way

Poussin graph (303 words) [view diff] exact match in snippet view article find links to article

Colored Map." Bull. Amer. Math. Soc. 41, 407–413, 1935. A. Soifer, “Map coloring in the victorian age: problems and history”, Mathematics Competitions

Search algorithm (1,564 words) [view diff] exact match in snippet view article find links to article

scheduling problem Problems in constraint satisfaction, such as: The map coloring problem Filling in a sudoku or crossword puzzle In game theory and especially

Disjunctive sum (490 words) [view diff] no match in snippet view article find links to article

are Go, Nim, Sprouts, Domineering, the Game of the Amazons, and the map-coloring games. In such games, each component may be analyzed separately for simplifications

Carl B. Allendoerfer Award (114 words) [view diff] case mismatch in snippet view article find links to article

Evolution of Group Theory: A Brief Survey Saul Stahl 1986 The Other Map Coloring Theorem Bart Braden 1986 Design of an Oscillating Sprinkler Philip D

Mathematical Models (Cundy and Rollett) (776 words) [view diff] exact match in snippet view article

strip and Klein bottle, and physical models helping to visualize the map coloring problem on these surfaces. Also included are sphere packings. The models

Combinatorial map (823 words) [view diff] no match in snippet view article find links to article

Gerhard Ringel and J.W.T. Youngs in their famous solution of the Heawood map-coloring problem. The term "constellation" was not retained and instead "combinatorial

Tietze's graph (666 words) [view diff] exact match in snippet view article find links to article

Kartenfärbens auf einseitigen Flächen" [Some remarks on the problem of map coloring on one-sided surfaces] (PDF), DMV Annual Report, 19: 155–159 Clark, L

Gerhard Ringel (418 words) [view diff] no match in snippet view article find links to article

Collections. Ringel, Gerhard; Youngs, J.W.T. (1968). "Solution of the Heawood map-coloring problem". Proceedings of the National Academy of Sciences of the United

Regular dodecahedron (3,378 words) [view diff] no match in snippet view article find links to article

enclosing the most volume within the same radius. It has 43,380 nets. The map-coloring number of a regular dodecahedron's faces is 4. The distance between the

Heawood conjecture (827 words) [view diff] no match in snippet view article find links to article

332–338. Ringel, G.; Youngs, J. W. T. (1968). "Solution of the Heawood map-coloring problem". Proceedings of the National Academy of Sciences of the United

D-Wave Two (1,147 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 2015-03-20. Dahl, E. D. (November 2013). "Programming with D-Wave: Map Coloring Problem" (PDF). D-Wave Systems. Aaronson, Scott (16 January 2014). "What

Isabel Maddison (999 words) [view diff] case mismatch in snippet view article find links to article

Society in 1896 and in the Bulletin of 1897 a Note on the History of the Map Coloring Problem. In 1904, she was appointed both associate professor and assistant

Heawood number (433 words) [view diff] no match in snippet view article find links to article

1002/sapm1934131363 Gerhard Ringel; J. W. T. Youngs (1968), "Solution of the Heawood Map-Coloring Problem", Proceedings of the National Academy of Sciences, 60 (2): 438–445

Genetic code (8,044 words) [view diff] exact match in snippet view article find links to article

by the topology defined by the probable errors and is related to the map coloring problem. Game theory: Models based on signaling games combine elements

Ferdinand Rothbart (418 words) [view diff] exact match in snippet view article find links to article

received vocational training. He went on to learn etching, lithography and map coloring at the firm of H. L. Petersen. From 1845 to 1848, he executed a series

Snark (graph theory) (2,707 words) [view diff] exact match in snippet view article

Kartenfärbens auf einseitigen Flächen" [Some remarks on the problem of map coloring on one-sided surfaces] (PDF), DMV Annual Report, 19: 155–159 Brinkmann

Möbius strip (9,589 words) [view diff] no match in snippet view article find links to article

155–159. Ringel, G.; Youngs, J. W. T. (1968). "Solution of the Heawood map-coloring problem". Proceedings of the National Academy of Sciences of the United

John William Theodore Youngs (279 words) [view diff] no match in snippet view article find links to article

1951 Ringel, Gerhard; Youngs, J.W.T. (1968). "Solution of the Heawood map-coloring problem". Proc. Natl. Acad. Sci. USA. 60 (2): 438–445. Bibcode:1968PNAS

De Bruijn–Erdős theorem (graph theory) (3,616 words) [view diff] case mismatch in snippet view article

e.g. Kanamori (2008). Erdős & Hajnal (1968). Barnette, David (1983), Map Coloring, Polyhedra, and the Four-Color Problem, Dolciani Mathematical Expositions

Nightfall (video game) (1,196 words) [view diff] exact match in snippet view article

visited or can see, much as games like Marathon do. In addition, the map coloring changes relative to the users altitude, so they can see if rooms are

Head/tail breaks (6,425 words) [view diff] exact match in snippet view article find links to article

code for the head/tail breaks algorithm. It works great for choropleth map coloring. pysal.esda.mapclassify: Python classification schemes for choropleth

Graph coloring game (4,073 words) [view diff] no match in snippet view article find links to article

Tomasz; Grytczuk, Jaroslaw; Kierstead, H. A.; Zhu, Xuding (2007). "The Map-Coloring Game" (PDF). American Mathematical Monthly. 114 (9): 793–803. doi:10