Register
Save?
Register
Home
Forums
Algebra
Geometry
Trigonometry
PreCalculus
Statistics
Calculus
Differential Geometry
Number Theory
Discrete Math
Applied Math
Differential Equations
Business Math
Physics Help
Chemistry Help
Advanced Search
Forum
University Math Help Forum
Discrete Math
How to prove that the genus of a graph is less than the crossing number?
Results 1 to 1 of 1
Thread:
How to prove that the genus of a graph is less than the crossing number?
LinkBack
LinkBack URL
About LinkBacks
Thread Tools
Show Printable Version
Subscribe to this Thread…
Display
Linear Mode
Switch to Hybrid Mode
Switch to Threaded Mode
Mar 1st 2014,
02:45 PM
#1
laurenad8
Newbie
Joined
Feb 2014
From
arizona
Posts
3
How to prove that the genus of a graph is less than the crossing number?
How to prove that g is less than k?
Follow Math Help Forum on
Facebook
and
Google+
«
Finding a graph with chromatic number of 4

How can I solve this recursive relation?
»
Similar Math Help Forum Discussions
Graph Theory / Chromatic Number of a Complete Graph
Posted in the Discrete Math Forum
Replies:
1
Last Post:
Nov 15th 2011,
10:59 AM
(Graph Theory)Prove that graph X is a tree.
Posted in the Discrete Math Forum
Replies:
1
Last Post:
Aug 1st 2011,
03:30 AM
Prove that the crossing number of K6 is at least 3
Posted in the Discrete Math Forum
Replies:
0
Last Post:
Dec 5th 2010,
05:53 AM
Prove That a graph G which is a tree is not an eulerean Graph
Posted in the Discrete Math Forum
Replies:
6
Last Post:
Nov 12th 2010,
08:03 AM
Genus of a graph
Posted in the Discrete Math Forum
Replies:
0
Last Post:
Dec 6th 2009,
07:09 PM
Search Tags
crossing
,
genus
,
graph
,
number
,
prove
View Tag Cloud