∑ZWMath CoursesSyllabusExercises
ES
ZWMath›Discrete mathematics›Graph theory›Planar graph›ZW-PLANAR-GRAPH-003
Course menu
AreaCombinatoricsCourseDiscrete mathematicsTopicGraph theory
Proofs and induction4
  • Direct proof
  • Proof by contradiction
  • Mathematical induction
  • Strong induction
Sets and relations4
  • Set operations
  • Inclusion-exclusion principle
  • Partial order relation
  • Hasse diagram
Counting8
  • Multiplication principle
  • Factorial
  • Permutations with repetition
  • Pigeonhole principle
  • Binomial coefficient
  • Binomial theorem
  • Combinations with repetition
  • Permutations and combinations Probability and statistics
Graph theory10
  • Graph
  • Degree of a vertex
  • Path in a graph
  • Connected graph
  • Tree
  • Eulerian cycle
  • Hamiltonian cycle
  • Bipartite graph
  • Graph coloring
  • Planar graph
Recurrences and arithmetic7
  • Recurrence relation
  • Divisibility
  • Greatest common divisor
  • Euclidean algorithm
  • Modular congruence
  • Homogeneous linear recurrence
  • Prime number

Exercise · ZW-PLANAR-GRAPH-003 · ★☆☆ Basic

A plane drawing of a connected graph has 6 vertices and 5 faces. How many edges does it have?

Choose one option.

Show answer
  • D. 9

← Back to the question

Explanation

From \(v-e+f=2\) we get \(e=v+f-2=6+5-2=9\).

Study Discrete mathematics in ZWMath →

Review the concept: Planar graph

A planar graph is a graph that can be drawn in the plane with no crossing edges; such a drawing, for \(v\) vertices and \(e\) edges, splits the plane into \(f\) faces.

\[v-e+f=2\]

More practice problems: planar graph

  • ZW-PLANAR-GRAPH-001 Which of the following complete graphs is planar?
  • ZW-PLANAR-GRAPH-002 A connected planar graph has v=8 vertices and e=12 edges. How many faces (counting the outer one) d…
  • ZW-PLANAR-GRAPH-004 A simple, connected, planar graph has v=7 vertices. What is the largest possible number of edges?
  • ZW-PLANAR-GRAPH-005 Why is K_5 not planar?
  • ZW-PLANAR-GRAPH-006 A tree with 10 vertices is drawn in the plane. How many faces does the drawing have?
  • ZW-PLANAR-GRAPH-007 A planar graph, not necessarily connected, has 2 connected components, v=9 vertices and e=10 edges.…
  • ZW-PLANAR-GRAPH-008 A connected planar graph with no triangles satisfies e≤ 2v-4. Is K_3,3 (6 vertices, 9 edges, no tri…
  • ZW-PLANAR-GRAPH-009 A maximal planar graph with v=10 vertices (every face a triangle) has e=24 edges. How many faces do…

← ZW-PLANAR-GRAPH-002 ZW-PLANAR-GRAPH-004 →

Practice

⏱Exam simulator10 random questions with a grade☰All exercises
◉Open on course✦Open on free study↗Open on the map

ZWMath · Math from definition to practice. Open the interactive map · Syllabus · All exercises

Author: ORCID iD 0009-0009-8641-3511

Privacy · About Speedrunz · Contact