Add to ORKGA word (or phrase, sentence, etc.) is said to be king-graphable (KG) if each of its distinct letters can be placed on a square of an infinite chessboard such that the entire word or pharase can be spelled out by starting on the first letter and making only the moves of a chess king to get from letter to letter
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x ...
The game of chess is undoubtedly one of the most popular two-player strategy board games in history,...
A graph G=(V,E)G=(V,E) is word-representable if there exists a word ww over the alphabet VV such tha...
In a previous article we examined some properties of knight-graphable words. A word is knight-graph...
Imagine an arbitrarily large chessboard where some of the squares are labelled with distinct letters...
Most words are queen-graphable; each different letter can be placed on a chessboard in such a way th...
In chess, the queen is the most versatile piece, moving in any of eight directions; unlike the king,...
The February 1996 Word Ways introduced the concept of a queen\u27s-move-graphable word: place the di...
In chess, a king can move to nay of the eight adjacent squares on the board - up, down, left, right,...
Fig la is a S-graph (S for simple). It contains the number names FOUR, FIVE, SIX, SEVEN, EIGHT, NIN...
In this article, I present a new subject for logological study: the knight\u27s-tour letter square. ...
It was shown in the November 1968 Word Ways that 110 words of five or more letters (no letters repea...
A graph is word-representable if there exists a word over the alphabet such that letters and al...
As my recent contributions to Word Ways show, I enjoy graphing. But, one day I got bored with long ...
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x ...
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x ...
The game of chess is undoubtedly one of the most popular two-player strategy board games in history,...
A graph G=(V,E)G=(V,E) is word-representable if there exists a word ww over the alphabet VV such tha...
In a previous article we examined some properties of knight-graphable words. A word is knight-graph...
Imagine an arbitrarily large chessboard where some of the squares are labelled with distinct letters...
Most words are queen-graphable; each different letter can be placed on a chessboard in such a way th...
In chess, the queen is the most versatile piece, moving in any of eight directions; unlike the king,...
The February 1996 Word Ways introduced the concept of a queen\u27s-move-graphable word: place the di...
In chess, a king can move to nay of the eight adjacent squares on the board - up, down, left, right,...
Fig la is a S-graph (S for simple). It contains the number names FOUR, FIVE, SIX, SEVEN, EIGHT, NIN...
In this article, I present a new subject for logological study: the knight\u27s-tour letter square. ...
It was shown in the November 1968 Word Ways that 110 words of five or more letters (no letters repea...
A graph is word-representable if there exists a word over the alphabet such that letters and al...
As my recent contributions to Word Ways show, I enjoy graphing. But, one day I got bored with long ...
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x ...
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x ...
The game of chess is undoubtedly one of the most popular two-player strategy board games in history,...
A graph G=(V,E)G=(V,E) is word-representable if there exists a word ww over the alphabet VV such tha...