in Graph Theory
221 views
0 votes
0 votes

 

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

 

in Graph Theory
by
221 views

1 comment

Yes.. 

all non planar graph can be obtained from $K_5$ or $K_{3,3}$ using certain permitted operations.

Ref: K.H. Rosen

 

0
0

Please log in or register to answer this question.

Related questions

1 vote
1 vote
1 answer
3
prabhas44 asked in Graph Theory Jul 18, 2017
1,264 views
prabhas44 asked in Graph Theory Jul 18, 2017
1.3k views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true