Register

SELF DOUBT PLANARITY

219 views
0 votes
0 votes

 

IS THERE ANY SHORT TIME SAVING METHOD TO DETERMINE GRAPH IS PLANNER OR NOT

 

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
3
prabhas44 asked Jul 18, 2017
1,270 views
planarity is there in syllabus of graph theory or not?
User Avatar
2 votes
2 votes
2 answers
4
smartmeet asked Jan 11, 2017
1,357 views
#Chromatic number , Planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G) a) 2 b) 3 c) 4 d) None of these PS : (Explain: "every face is bordered by exactly 3 edges. ")
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number...
User Avatar
Link Copied!