-
Notifications
You must be signed in to change notification settings - Fork 87
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Minors and contraction #79
Comments
There is |
Awesome about A graph type could one dealing with minor properties. To this has anyone ever heard of SageMath? I have used this a few times when testing minors. The premise to me is the result of Robertson-Seymour, where a class of graphs can be defined by the exclusion list. For example (and forgive if I am speaking down) all planar graphs can be defined by any graph that does not have K5 or K33 as a minor (Wagner and Kuratowski work).
Having this as a graph type could at least focus on the topological side. |
I'm well aware of the main results of graph minors, especially the Robertson-Seymour theorem. (which is in my tier 1 list of theorems) I'm not sure what is the graph type you are proposing? Minor operations can be done on any graph type (as long as it supports mutations). Would it have some additional structure, like a tree decomposition, or something? Or would it be a type to define graph classes that excludes minors? |
It would be nice to have support for graph minors, at list for
SimpleGraph
s and possibly even in the interface by defining something likecontract_edge!(g, s, d)
The text was updated successfully, but these errors were encountered: