<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Graphs &#8211; Sumthing Else</title>
	<atom:link href="https://sumthing-else.com/product-category/graphs/feed/" rel="self" type="application/rss+xml" />
	<link>https://sumthing-else.com</link>
	<description>Curiosity. Learning. Something more.</description>
	<lastBuildDate>Wed, 30 Sep 2026 09:23:01 +0000</lastBuildDate>
	<language>en-GB</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.4</generator>
	<item>
		<title>Graphs – Lesson 6: Networks and Shortest Paths</title>
		<link>https://sumthing-else.com/product/graphs-lesson-6-networks-and-shortest-paths/</link>
					<comments>https://sumthing-else.com/product/graphs-lesson-6-networks-and-shortest-paths/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Mon, 14 Sep 2026 14:32:38 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=1860</guid>

					<description><![CDATA[Find the quickest, cheapest or safest route through a network. Learners explore weighted graphs and use Dijkstra’s algorithm to solve shortest-path problems systematically.]]></description>
										<content:encoded><![CDATA[<p>Finish the Graphs course by applying graph theory to real-world networks.</p>
<p>Graphs can represent roads, railways, computer connections, delivery routes and many other systems. When the edges carry numbers, the aim is often to find a route with the smallest total weight.</p>
<p>In this lesson, learners explore:</p>
<ul>
<li>weighted graphs and what their weights can represent;</li>
<li>calculating and comparing the weights of complete paths;</li>
<li>finding shortest routes by inspection;</li>
<li>using Dijkstra’s algorithm step by step;</li>
<li>recording tentative distances and settled vertices;</li>
<li>understanding why the cheapest next edge need not lead to the cheapest complete route;</li>
<li>investigating how closures and changed weights affect a network.</li>
</ul>
<p>The download includes the main printable lesson and a supplementary booklet containing additional examples, answer checks and complete model solutions.</p>
<p>Suitable for learners aged 10 and over. Familiarity with paths and basic graph terminology is helpful.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/graphs/6-networks-and-shortest-paths/">Lesson 6</a> and the conclusion of the Beyond Curriculum: Graphs course.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi </a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/graphs-lesson-6-networks-and-shortest-paths/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Graphs – Lesson 5: Colouring Maps</title>
		<link>https://sumthing-else.com/product/graphs-lesson-5-colouring-maps/</link>
					<comments>https://sumthing-else.com/product/graphs-lesson-5-colouring-maps/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Mon, 14 Sep 2026 14:28:56 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=1858</guid>

					<description><![CDATA[How many colours does a map really need? Turn neighbouring regions into a graph, create proper colourings and investigate why some graphs require more colours than others.]]></description>
										<content:encoded><![CDATA[<p class="isSelectedEnd">Discover the mathematics hidden inside an ordinary coloured map.</p>
<p class="isSelectedEnd">Learners replace each region with a vertex and join vertices whose regions share a border. This transforms a visual map-colouring problem into a graph-colouring problem that can be explored systematically.</p>
<p class="isSelectedEnd">This lesson introduces:</p>
<ul data-spread="false">
<li>turning a map into an adjacency graph;</li>
<li>proper colourings;</li>
<li>the chromatic number of a graph;</li>
<li>finding colourings that use as few colours as possible;</li>
<li>explaining why fewer colours cannot work;</li>
<li>the statement and history of the Four Colour Theorem;</li>
<li>applications such as timetable and scheduling problems.</li>
</ul>
<p class="isSelectedEnd">The download includes the main lesson and a supplementary examples booklet with further problems, answer checks and model solutions.</p>
<p class="isSelectedEnd">Suitable for learners aged 10 and over. No previous experience of graph colouring is required.</p>
<p>This is <a href="https://sumthing-else.com/product/graphs-lesson-4-drawing-without-lifting-your-pencil/">Lesson 5</a> of the six-part Beyond Curriculum:<a href="https://sumthing-else.com/beyond-curriculum/graphs/"> Graphs course</a>.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi </a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/graphs-lesson-5-colouring-maps/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Beyond Curriculum: Graphs — Complete Course</title>
		<link>https://sumthing-else.com/product/graphs-complete-course/</link>
					<comments>https://sumthing-else.com/product/graphs-complete-course/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Mon, 14 Sep 2026 14:11:38 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=1854</guid>

					<description><![CDATA[Discover how dots and lines can model bridges, maps, journeys and networks. This free six-lesson printable course introduces graph theory through visual explanations, investigations, puzzles and fully worked supplementary examples.]]></description>
										<content:encoded><![CDATA[<p>Graphs turn complicated situations into dots and lines—and reveal surprising connections between handshakes, bridges, maps, drawing puzzles and transport networks.</p>
<p>This complete printable course guides learners from the basic language of vertices, edges and degrees to Euler trails, map colouring and shortest-path algorithms. Each lesson develops the ideas through diagrams, questions and investigations, while the accompanying Examples booklets provide additional problems, answer checks and complete worked solutions.</p>
<p>This complete course includes:</p>
<p>• Lesson 1: What is a graph?<br />
• Lesson 2: The Bridges of Königsberg<br />
• Lesson 3: Paths, cycles and Euler trails<br />
• Lesson 4: Drawing without lifting your pencil<br />
• Lesson 5: Colouring maps<br />
• Lesson 6: Networks and shortest paths<br />
• a combined Complete Course teaching booklet;<br />
• concise answers and discussion;<br />
• six supplementary Examples booklets;<br />
• 48 additional examples and six challenges;<br />
• complete worked solutions.</p>
<p>Suitable for learners aged 10 and over. No previous knowledge of graph theory is required. Younger learners may benefit from working alongside an adult, particularly in the later lessons.</p>
<p>☕ Free to download</p>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can support <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">Sumthing Else on Ko-fi</a>.</p>
<p>This is the complete six-part Beyond Curriculum: Graphs course from Sumthing Else.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/graphs-complete-course/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Graphs – Lesson 4: Drawing Without Lifting Your Pencil</title>
		<link>https://sumthing-else.com/product/graphs-lesson-4-drawing-without-lifting-your-pencil/</link>
					<comments>https://sumthing-else.com/product/graphs-lesson-4-drawing-without-lifting-your-pencil/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Mon, 14 Sep 2026 12:07:36 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=1837</guid>

					<description><![CDATA[Can you draw a complete picture without lifting your pencil or tracing any line twice? Use vertex degrees to predict which one-stroke drawings are possible before attempting them.]]></description>
										<content:encoded><![CDATA[<p>Put Euler trails into action with a collection of one-stroke drawing puzzles.</p>
<p>Instead of relying on trial and error, learners count the degree of each vertex and use the number of odd vertices to predict whether a drawing is possible. They then decide where a successful route must begin and end.</p>
<p>This lesson explores:</p>
<ul>
<li>representing drawings as graphs;</li>
<li>counting odd- and even-degree vertices;</li>
<li>deciding whether a one-stroke drawing is possible;</li>
<li>choosing the correct starting and finishing vertices;</li>
<li>distinguishing crossings from marked vertices;</li>
<li>explaining failed attempts mathematically;</li>
<li>repairing and designing one-stroke drawings.</li>
</ul>
<p>The download includes the main printable lesson together with additional examples, answer checks and complete model solutions.</p>
<p>Suitable for learners aged 10 and over. Familiarity with vertices, edges and degrees is recommended.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/graphs/4-drawing-without-lifting-your-pencil/">Lesson 4</a> of the six-part Beyond Curriculum: <a href="https://sumthing-else.com/beyond-curriculum/graphs/">Graphs course</a>.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi </a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/graphs-lesson-4-drawing-without-lifting-your-pencil/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Graphs – Lesson 3: Paths, Cycles and Euler Trails</title>
		<link>https://sumthing-else.com/product/graphs-lesson-3-paths-cycles-and-euler-trails/</link>
					<comments>https://sumthing-else.com/product/graphs-lesson-3-paths-cycles-and-euler-trails/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Mon, 14 Sep 2026 11:54:04 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=1834</guid>

					<description><![CDATA[What is the difference between a path, a cycle and a trail? Learn the language used to describe routes through graphs and investigate routes that use every edge exactly once.]]></description>
										<content:encoded><![CDATA[<p>Build the language needed to describe and compare routes through a graph.</p>
<p>Learners explore paths, cycles and trails before meeting Euler trails: special routes that use every edge exactly once. Carefully chosen examples help distinguish ideas that can initially look very similar.</p>
<p>This lesson includes:</p>
<ul>
<li>clear definitions of paths, cycles and trails;</li>
<li>examples showing the difference between repeating vertices and repeating edges;</li>
<li>practice tracing and recording routes;</li>
<li>an introduction to Euler trails and Euler circuits;</li>
<li>puzzles requiring both experimentation and explanation;</li>
<li>answers and discussion;</li>
<li>supplementary examples with worked solutions.</li>
</ul>
<p>Suitable for learners aged 10 and over. It works best after Lessons 1 and 2 but can also be used independently with some adult guidance.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/graphs/3-paths-cycles-and-euler-trails/">Lesson 3</a> of the six-part Beyond Curriculum: Graphs course.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi </a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/graphs-lesson-3-paths-cycles-and-euler-trails/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Graphs – Lesson 2: The Bridges of Königsberg</title>
		<link>https://sumthing-else.com/product/graphs-2-bridges-of-konigsberg-lesson-handout/</link>
					<comments>https://sumthing-else.com/product/graphs-2-bridges-of-konigsberg-lesson-handout/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Thu, 10 Sep 2026 21:40:17 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/product/graphs-2-bridges-of-konigsberg-lesson-handout/</guid>

					<description><![CDATA[Can every bridge be crossed exactly once? Explore Euler’s famous Königsberg puzzle and see how turning a map into a graph makes a difficult route problem much easier to investigate.]]></description>
										<content:encoded><![CDATA[<p>Travel back to eighteenth-century Königsberg and investigate the puzzle that helped begin graph theory.</p>
<p>The challenge sounds simple: can you walk through the city and cross each of its seven bridges exactly once? Learners replace areas of land with vertices and bridges with edges, turning a complicated map into a much simpler mathematical graph.</p>
<p>This lesson develops:</p>
<ul>
<li>translating maps and routes into graphs;</li>
<li>counting the degree of each vertex;</li>
<li>recognising the importance of odd and even degrees;</li>
<li>testing possible routes systematically;</li>
<li>explaining why some route puzzles are impossible;</li>
<li>mathematical reasoning through a famous historical problem.</li>
</ul>
<p>The download also includes further practice and worked solutions in the supplementary examples booklet.</p>
<p>Suitable for learners aged 10 and over. Lesson 1 is helpful but not essential.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/graphs/2-bridges-of-konigsberg/">Lesson 2</a> of the six-part Beyond Curriculum: <a href="https://sumthing-else.com/beyond-curriculum/graphs/">Graphs course</a>.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi </a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/graphs-2-bridges-of-konigsberg-lesson-handout/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Graphs – Lesson 1: What Is a Graph?</title>
		<link>https://sumthing-else.com/product/beyond-curriculum-graphs-supplementary-examples-1-what-is-a-graph/</link>
					<comments>https://sumthing-else.com/product/beyond-curriculum-graphs-supplementary-examples-1-what-is-a-graph/#respond</comments>
		
		<dc:creator><![CDATA[Daria]]></dc:creator>
		<pubDate>Tue, 08 Sep 2026 09:39:54 +0000</pubDate>
				<guid isPermaLink="false">https://sumthing-else.com/?post_type=product&#038;p=1320</guid>

					<description><![CDATA[Discover how a collection of dots and lines becomes a mathematical graph. Learners explore vertices, edges and degrees through approachable puzzles and practical examples.]]></description>
										<content:encoded><![CDATA[<p>Begin an exploration of graph theory with its simplest ingredients: dots and lines.</p>
<p>In this introductory lesson, learners discover how graphs can represent connections between places, people and objects. They learn the meanings of vertex, edge and degree, practise translating everyday situations into graphs, and investigate how the structure changes when edges are added or removed.</p>
<p>This lesson includes:</p>
<ul>
<li>a clear introduction to vertices and edges;</li>
<li>practice counting vertices, edges and degrees;</li>
<li>real-world examples of networks;</li>
<li>opportunities to draw and interpret graphs;</li>
<li>answers and discussion;</li>
<li>a supplementary booklet containing further examples and worked solutions.</li>
</ul>
<p>Suitable for learners aged 10 and over. No previous knowledge of graph theory is required.</p>
<p>This is <a href="https://sumthing-else.com/beyond-curriculum/graphs/1-what-is-a-graph/">Lesson 1</a> of the six-part Beyond Curriculum: <a href="https://sumthing-else.com/beyond-curriculum/graphs/">Graphs course</a>.</p>
<h3>☕ Free to download</h3>
<p>This resource is completely free. If you find it useful and would like to support the creation of more free mathematics resources, you can <a href="https://ko-fi.com/sumthingelse" target="_blank" rel="noopener">support Sumthing Else on Ko-fi </a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://sumthing-else.com/product/beyond-curriculum-graphs-supplementary-examples-1-what-is-a-graph/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
