maths.free › Combinatorics & Graph Theory › Colouring and planar graphs
Colouring and planar graphs
Chromatic number, Euler's formula V − E + F = 2, and the four-colour theorem.
Colour vertices so neighbours differ; the fewest colours needed is the chromatic number. For a planar graph V − E + F = 2, which bounds edges by 3V − 6 and shows K₅ is not planar. Picture it: any map needs at most four colours, proven with a computer in 1976. Think it: Euler's formula is the Euler characteristic, the same invariant that distinguishes a sphere from a torus.
ಕಾರ್ಯಗತಗೊಂಡ ಮಾದರಿ · 6 - 2
ಅಡಿಯಿಡು (step)
- -2 + 6 = 4
Add: -2 + 6 = 4.
ಉತ್ತರವನ್ನು ತಿಳಿಸಿ
ಈಗ ನೀವು ಪ್ರತಿಯೊಂದು ಹೆಜ್ಜೆಯಲ್ಲಿ, ಒಂದು ಚಿತ್ರವನ್ನು ನೀವು ಕೇಳುವ ತನಕ ಅಡಗಿಸಿಟ್ಟಿಡಿರಿ.
A free account adds notes on every lesson, a record of what you have finished, your solved problems in one place, and a tutor you can ask about this page. The maths itself is open to everyone, signed in or not.
ಮೇಲೆ ಗುರುತು ಹಾಕು ಪ್ರವೇಶ (ಲಾಗಿನ್)ಇಲ್ಲಿ ಬಳಸಲಾದ ಸಂಕೇತಗಳು
ಈ ವಚನದಲ್ಲಿ ಬಳಸಲಾಗಿರುವ ಗ್ರೀಕ್ ಪದವು, ಚಿತ್ರ ಮತ್ತು ಚಿತ್ರಗಳನ್ನು ನೀವು ಸುಲಭವಾಗಿ ಅರ್ಥಮಾಡಿಕೊಳ್ಳಲು ಸಹಾಯ ಮಾಡುತ್ತದೆ.
ಹೇಗೆ: Colouring and planar graphs
- Add: -2 + 6 = 4.
ಜನರು ಕೇಳುವುದು
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
ಇನ್ನಷ್ಟು Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and Hamilton