Eodermdrome on:
[Wikipedia]
[Google]
[Amazon]
An eodermdrome is a form of 
Eckler searched for all eodermdromes in ''Webster's Dictionary''. One of his examples is ''supersaturates''. The graph of the complete word contains a subgraph which is a subdivision of the non-
By extension, the vertices can be identified with words instead of letters to form eodermdromic phrases or sentences.
The concept has been studied within both mathematics and linguistics.
word play
Word play or wordplay (also: play-on-words) is a literary technique and a form of wit in which words used become the main subject of the work, primarily for the purpose of intended effect or amusement. Examples of word play include puns, pho ...
wherein a word (or phrase) is formed from a set of letters (or words) in such a way that it has a non-planar
Planar is an adjective meaning "relating to a plane (geometry)".
Planar may also refer to:
Science and technology
* Planar (computer graphics), computer graphics pixel information from several bitplanes
* Planar (transmission line technologies), ...
spelling net. Gary S. Bloom, Allan Gewirtz, John W. Kennedy, and Peter J. Wexler first described the eodermdrome in May 1980, and it subsequently became more widely known after publication in '' Word Ways: The Journal of Recreational Linguistics'' in August 1980.
It is well illustrated by the word ''eodermdrome'' itself. ''Eodermdrome'' contains only the letters e, o, d, r and m. When plotted as a graph, the lettered vertices are sequentially connected by edges to spell a word. If the graph is non-planar, the word is an eodermdrome. The graph of eodermdrome is the non-planar graph K5.
Eckler searched for all eodermdromes in ''Webster's Dictionary''. One of his examples is ''supersaturates''. The graph of the complete word contains a subgraph which is a subdivision of the non-planar graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cro ...
K3,3, and as such is itself non-planar.
By extension, the vertices can be identified with words instead of letters to form eodermdromic phrases or sentences.
The concept has been studied within both mathematics and linguistics.
See also
*Graph theory
In mathematics, graph theory is the study of '' graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conn ...
*Kuratowski's theorem
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivi ...
*Palindrome
A palindrome is a word, number, phrase, or other sequence of symbols that reads the same backwards as forwards, such as the words ''madam'' or ''racecar'', the date and time ''11/11/11 11:11,'' and the sentence: "A man, a plan, a canal – Panam ...
References
{{reflist Application-specific graphs Word play Planar graphs