The Minor Crossing Number of Graphs with an Excluded Minor

Details The Minor Crossing Number of Graphs with an Excluded Minor The Minor Crossing Number of Graphs with an Excluded Minor

2006-09-25

arxiv.org/abs/math/0609707v2

Electronic J. Combinatorics 15:R4, 2008

Mathematics

Combinatorics

Scientific paper

The "minor crossing number" of a graph $G$ is the minimum crossing number of
a graph that contains $G$ as a minor. It is proved that for every graph $H$
there is a constant $c$, such that every graph $G$ with no $H$-minor has minor
crossing number at most $c|V(G)|$.

Affiliated with

Also associated with

No associations

Rating

The Minor Crossing Number of Graphs with an Excluded Minor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Minor Crossing Number of Graphs with an Excluded Minor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Minor Crossing Number of Graphs with an Excluded Minor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15711