Back to Discover
🔢

Edge cover

math Maturity 11-13

Imagine dots joined by lines.

Edge-cover.svg
Edge-cover.svg
We want to touch every dot. We can use the lines to do this. We try to use just a few lines. This helps us solve a puzzle. Can you find the lines?
Minimum-edge-cover.svg
Minimum-edge-cover.svg

40 words
🖼️ Images & Media (3)
File:Edge-cover.svg
Edge-cover.svg
File:Minimum-edge-cover.svg
Minimum-edge-cover.svg
File:Minimum-edge-cover-from-maximum-matching.svg
Minimum-edge-cover-from-maximum-matching.svg
Up Next
🔢
Vertex cover
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Vertex cover 0% Kőnig's theorem (graph theory) 0% Matching (graph theory) 0% Maximum-cardinality matching 0% Bipartite graph 0% Assignment problem 0%

🔬 Go deeper

More advanced topics to explore

Vertex cover Kőnig's theorem (graph theory) Matching (graph theory) Maximum-cardinality matching

🪜 Step back

Simpler topics to build understanding

Vizing's theorem Petersen graph Hungarian algorithm Degree (graph theory)
📚 Content adapted from Wikipedia | Readability: FK 11.0 | Vital Level 5