Revision history [back]

consider the following definition: A subgraph H of a graph $G$ is called an elementary subgraph if each component of $H$ is either an edge or a cycle of length at least $3$. A spanning elementary subgraph is a subgraph having all components either path or cycles. Now my problem is: Consider the following code:

G=graphs.EmptyGraph()

G.add_edges([(1,2),(2,3),(3,4),(4,5),(5,2),(6,5),(6,7)])

G.show()

Can we have a sage code that gives all possible spanning subgraphs on $6$ vertices of the above graph

consider the following definition: A subgraph H of a graph $G$ is called an elementary subgraph if each component of $H$ is either an edge or a cycle of length at least $3$. A spanning elementary subgraph is a subgraph having all components either path or cycles. Now my problem is: Consider the following code:

G=graphs.EmptyGraph()

G.add_edges([(1,2),(2,3),(3,4),(4,5),(5,2),(6,5),(6,7)])

G.show()

Can we have a sage code that gives all possible spanning subgraphs on $6$ vertices of the above graph

consider the following definition: A subgraph H of a graph $G$ is called an elementary subgraph if each component of $H$ is either an edge or a cycle of length at least $3$. A spanning elementary subgraph is a subgraph having all components either edge (edge is a path on two vertices) or cycles. Now my problem is: Consider the following code:

G=graphs.EmptyGraph()

G.add_edges([(1,2),(2,3),(3,4),(4,5),(5,2),(6,5),(6,7)])

G.show()

Can we have a sage code that gives all possible spanning subgraphs on $6$ vertices of the above graph

Actually I am trying to find the all possible spanning elementary subgraphs on $6$ vertices of the above graph. By $6$ vertices, I meant the subgraphs of order 6 of the original graph

consider Consider the following definition: definition:

A subgraph H of a graph $G$ is called an elementary subgraph subgraph if each component of $H$ is either an edge or a cycle of length length at least $3$. $3$. A spanning elementary subgraph is a subgraph having having all components either edge (edge is a path on two vertices) vertices) or cycles. cycles.

Now my problem is: Consider the following code:

G = graphs.EmptyGraph()
G.add_edges([(1, 2), (2, 3), (3, 4), (4, 5), (5, 2), (6, 5), (6, 7)])
G.show()

Can we have a sage Sage code that gives all possible spanning subgraphs subgraphs on $6$ vertices of the above graphgraph?

Actually I am trying to find the all possible spanning elementary elementary subgraphs on $6$ vertices of the above graph. By $6$ vertices, vertices, I meant mean the subgraphs of order 6 of the original graphgraph.

Consider the following definition:

A subgraph H of a graph $G$ is called an elementary subgraph if each component of $H$ is either an edge or a simple cycle of length at least $3$. A spanning elementary subgraph is a subgraph having all components either edge (edge is a path on two vertices) or simple cycles.

Now my problem is: Consider the following code:

G = graphs.EmptyGraph()
G.add_edges([(1, 2), (2, 3), (3, 4), (4, 5), (5, 2), (6, 5), (6, 7)])
G.show()

Can we have a Sage code that gives all possible spanning subgraphs on $6$ vertices of the above graph?

Actually I am trying to find the all possible spanning elementary subgraphs on $6$ vertices of the above graph. By $6$ vertices, I mean the subgraphs of order 6 of the original graph.