Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
graphs that can be embedded into the plane, i.e. that can be drawn without crossings between the lines representing edges.
2
votes
Generalizations of Planar Graphs
Resembling the "quasiplanar graphs" that Joe Malkevitch mentioned, you have the class of graphs with crossing number (in the plane) at most k for any $k \geq 0$. For $k = 0$ these are exactly the plan …
5
votes
Generalizations of Planar Graphs
Ooh, this is another "off the top of my head" one, but another generalization of the family of planar graphs is matroid families closed under taking duals.
9
votes
Generalizations of Planar Graphs
Some of the broadest generalizations generalize the family of planar graphs. Possibly the most important generalization along these lines is the notion of a minor-closed graph family, among which the …