Search by Topic

Resources tagged with Networks/Graph Theory similar to Sandwiches:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 21 results

Broad Topics > Decision Mathematics and Combinatorics > Networks/Graph Theory

problem icon

Round-robin Scheduling

Stage: 2 and 3 Challenge Level: Challenge Level:1

Think about the mathematics of round robin scheduling.

problem icon

Ding Dong Bell

Stage: 3, 4 and 5

The reader is invited to investigate changes (or permutations) in the ringing of church bells, illustrated by braid diagrams showing the order in which the bells are rung.

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?

problem icon

The Four Colour Theorem

Stage: 3 and 4

The Four Colour Conjecture was first stated just over 150 years ago, and finally proved conclusively in 1976. It is an outstanding example of how old ideas can be combined with new discoveries. prove. . . .

problem icon

Königsberg

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?

problem icon

Rail Network

Stage: 2 Challenge Level: Challenge Level:1

This drawing shows the train track joining the Train Yard to all the stations labelled from A to S. Find a way for a train to call at all the stations and return to the Train Yard.

problem icon

Dice, Routes and Pathways

Stage: 1, 2 and 3

This article for teachers discusses examples of problems in which there is no obvious method but in which children can be encouraged to think deeply about the context and extend their ability to. . . .

problem icon

Only Connect

Stage: 3 Challenge Level: Challenge Level:1

The graph represents a salesman’s area of activity with the shops that the salesman must visit each day. What route around the shops has the minimum total distance?

problem icon

Hamilton's Puzzle

Stage: 2 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

I start my journey in Rio de Janeiro and visit all the cities as Hamilton described, passing through Canberra before Madrid, and then returning to Rio. What route could I have taken?

problem icon

Konigsberg Plus

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.

problem icon

Tourism

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.

problem icon

Delia's Routes

Stage: 2 Challenge Level: Challenge Level:2 Challenge Level:2

A little mouse called Delia lives in a hole in the bottom of a tree.....How many days will it be before Delia has to take the same route again?

problem icon

Sprouts Explained

Stage: 2, 3, 4 and 5

This article invites you to get familiar with a strategic game called "sprouts". The game is simple enough for younger children to understand, and has also provided experienced mathematicians with. . . .

problem icon

Pattern of Islands

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...

problem icon

Tangles

Stage: 3 and 4

A personal investigation of Conway's Rational Tangles. What were the interesting questions that needed to be asked, and where did they lead?

problem icon

Going Places with Mathematicians

Stage: 2 and 3

This article looks at the importance in mathematics of representing places and spaces mathematics. Many famous mathematicians have spent time working on problems that involve moving and mapping. . . .

problem icon

Networks and Nodes

Stage: 2 Challenge Level: Challenge Level:2 Challenge Level:2

Without taking your pencil off the paper or going over a line or passing through one of the points twice, can you follow each of the networks?

problem icon

Redblue

Stage: 2 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Investigate the number of paths you can take from one vertex to another in these 3D shapes. Is it possible to take an odd number and an even number of paths to the same vertex?

problem icon

Diagonal Trace

Stage: 2 Challenge Level: Challenge Level:2 Challenge Level:2

You can trace over all of the diagonals of a pentagon without lifting your pencil and without going over any more than once. Can the same thing be done with a hexagon or with a heptagon?

problem icon

Geometry and Gravity 2

Stage: 3, 4 and 5

This is the second of two articles and discusses problems relating to the curvature of space, shortest distances on surfaces, triangulations of surfaces and representation by graphs.

problem icon

Classifying Solids Using Angle Deficiency

Stage: 3 and 4 Challenge Level: Challenge Level:1

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry