Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is a (even or odd) subdivision of $H$?
In particularly, I'm looking at the case when $H$ is $K_{3,3}$.
1 | initial version |
Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is a (even or odd) subdivision of $H$?
In particularly, I'm looking at the case when $H$ is $K_{3,3}$.
Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is a (even or an even (or odd) subdivision of $H$?
In particularly, I know that the command: G.minor(H) will tell whether $G$ contains a graph which is a subdivision of $H$?
But I'm looking at the case when $H$ is $K_{3,3}$. for whether it contains an even subdivision. How do I do this?
Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is an even (or odd) subdivision of $H$?
I know that the command: G.minor(H) will tell whether $G$ contains a graph subgraph which is a subdivision of $H$?
But I'm looking for whether it contains an even subdivision. How do I do this?
Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is an even (or odd) subdivision of $H$?
I know that the command: G.minor(H) will tell whether $G$ contains a subgraph which is a subdivision of $H$?
But I'm looking for whether it contains an even subdivision. How do I do this?
Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is an even (or odd) subdivision of $H$?
I know that the command: G.minor(H) will tell whether $G$ contains a subgraph which is a subdivision of $H$? $H$.
But I'm looking for whether it contains an even subdivision. How do I do this?
6 | retagged |
Let $G$ and $H$ be two given graphs. Suppose $H$ is smaller than $G$.
How do I check whether $G$ contains a subgraph which is an even (or odd) subdivision of $H$?
I know that the command: G.minor(H) will tell whether $G$ contains a subgraph which is a subdivision of $H$.
But I'm looking for whether it contains an even subdivision. How do I do this?