306 views

1 Answer

2 votes
2 votes

From Kurtowski's test

e<=3*n-6  (if graph is connected planar simple graph)

=> n>=(e+6)/3

Related questions

0 votes
0 votes
2 answers
1
yuuchan asked Jul 22, 2023
475 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
0 votes
0 votes
1 answer
2
R S BAGDA asked Apr 27, 2022
273 views
What is the number of faces in a connected plane graph having 23 vertices, 30 edges?
1 votes
1 votes
1 answer
3