Skip to main content

Questions tagged [graph-theory]

A puzzle built around graphs: sets of nodes joined together by paths. Use with [mathematics]

Filter by
Sorted by
Tagged with
1 vote
4 answers
375 views

Several straight lines drawn on a sheet of paper divide it into polygons. Is it always possible to color each polygon with one of two colors so that any two polygons that share an edge are of ...
Hemant Agarwal's user avatar
21 votes
2 answers
1k views

The following image depicts a small part of a vast "cube garden": This garden started as a single 1x1x1 cube, which was grown into the complex shape you see here by performing the following ...
plasticinsect's user avatar
18 votes
3 answers
2k views

Netwalk (and other names) is a puzzle game with randomly generated "networks" consisting of computers (nodes), a source node, and connectors (either a straight through pipe, a right-angled ...
Canadian Luke's user avatar
7 votes
4 answers
629 views

Consider the following graph (3 edges between A,B; 3 edges between B,C; 2 edges between A,C). How many trails are there that start from vertex A and end at vertex C? Two trails are considered the same ...
Lucenaposition's user avatar
7 votes
2 answers
605 views

I am trying to memorize the 143 three-digit primes. It would help if I could arrange them around a circle in which any two next to each other share at least two (not necessarily different) digits. For ...
Bernardo Recamán Santos's user avatar
14 votes
3 answers
2k views

Anita lives in a city with a peculiar road system: every road is a circle (not necessarily of the same radius). The rules of the system are simple: no sharp turns. That is, if you are at a transversal ...
Pranay's user avatar
  • 20.9k
11 votes
2 answers
798 views

Find a set of ten positive integers such that in any subset of five of them there is at least one number with a common divisor (not necessarily the same) with all the other four, and yet, among the ...
Bernardo Recamán Santos's user avatar
17 votes
7 answers
2k views

A problem proposed by Ashay Burungale of Satara, Maharashtra, India, in the November 2008 issue of American Mathematical Monthly: In a certain town of population 2n + 1, all relations are reciprocal: ...
Hemant Agarwal's user avatar
3 votes
1 answer
283 views

We have many puzzles to find complete knight's tours – including on 4D boards, irregular boards and nonplanar boards – but few puzzles to find partial tours where only some cells are visited. I ...
Parcly Taxel's user avatar
  • 10.5k
16 votes
3 answers
3k views

My daughter has a LEGO Duplo railway set that she loves to play with. Here are some basic track elements in the set (I made the figures myself): the red element is a circular arc of 30°, the green ...
Pranay's user avatar
  • 20.9k
4 votes
3 answers
948 views

Variant of this lovely puzzle The playable version of the game You are given an empty chessboard as in the link above as 6x6. Place one knight anywhere you like. Then place as many pawns as possible ...
Oray's user avatar
  • 34.1k
4 votes
2 answers
2k views

In the making of this puzzle, I had to generate every possible space-filling curve for both the 5x8 grid and the 5x9 grid. The 5x8 grid went as expected. No matter where my space-filling curve ...
SlowMagic's user avatar
  • 15.5k
9 votes
2 answers
919 views

The Knight's Tour is a famous sequence of moves in a Chessboard. We now search for a Knight Tour such that the number of intersections drawn by the tour is minimal. Here is a valid Knight tour given ...
JKHA's user avatar
  • 7,968
5 votes
1 answer
602 views

You are given the next map where many flags are shown on their corresponding countries. Construct a forest of maximal weight such that: There exist at most one edge between two flags if and only if ...
JKHA's user avatar
  • 7,968
4 votes
3 answers
553 views

You have an array of fence posts sticking out of the ground. Each column has 4 posts, but the columns proceed west and east until they meet on the other side of the planet. You need to tie the posts ...
Dr Xorile's user avatar
  • 24.3k

15 30 50 per page
1
2 3 4 5
18