Ask Your Question

Why does graph minor not work with multiple edges?

asked 2013-05-11 14:30:09 -0500

Sammy Black gravatar image

When $H$ has multiple edges, and we ask whether it is a minor of another graph $G$, using the method:


the multiple edges are ignored. As a result, it can return True, when $H$ is not actually a minor of $G$.

Here is a small example of this incorrect behavior.

Let $H$ be a triangle with a double edge, and let $G$ be a square. Clearly, $H$ is not a minor of $G$.

H = Graph()
H.add_edges([(0,1), (0,1), (0,2), (1,2)])

G = Graph()
G.add_edges([(0,1), (0,3), (1,2), (2,3)])


The output is:

{0: [0], 1: [1], 2: [2, 3]}

Is there a work-around?

edit retag flag offensive close merge delete

1 answer

Sort by ยป oldest newest most voted

answered 2013-05-12 11:06:14 -0500

Nathann gravatar image

I would say that if you split all edges of both graph by adding adding a new vertex b joined to a and c where there was an edge from a to c (this is a way to transform a graph with multiple edges into a normal graph), then checking that one is a minor of the other would give you the good definition.

I expect it to be slower, though.

And the explanation to your question "why aren't multiple edges considered by the minor function" is very easy and natural : why should it ? Things get implemented if somebody who cares about them takes the time to do it. Otherwise, they are not implemented.


edit flag offensive delete link more


Yeah. I had already done that, but it was too slow. Thank you, though.

Sammy Black gravatar imageSammy Black ( 2013-05-12 12:42:50 -0500 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools


Asked: 2013-05-11 14:30:09 -0500

Seen: 168 times

Last updated: May 12 '13