# removeEdges -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways

## Synopsis

• Usage:
R' = removeEdges L
R = removeEdges S
R = removeEdges G
• Inputs:
• L, a list, containing graphs in various formats
• S, , a graph encoded in either Sparse6 or Graph6 format
• G, an object of class Graph
• Optional inputs:
• MinDegree => an integer, default value null, the minimum degree which a returned graph can have
• Outputs:
• R', a list, a list of all graphs obtained by removed one edge from the given graphs; it contains graphs in Graph6 or Sparse6 format
• R, a list, a list of all graphs obtained by removed one edge from the given graph; it contains graphs in the same format as the input

## Description

This method creates a list of all possible graphs obtainable from the given graph by removing one edge. Notice that isomorphic graphs are allowed within the list.

 ```i1 : removeEdges graph {{1,2},{1,3},{2,3},{3,4},{4,5}} o1 = {Graph{0 => {2} }, Graph{0 => {1} }, Graph{0 => {1, 2}}, Graph{0 1 => {2} 1 => {0, 2} 1 => {0} 1 2 => {0, 1, 3} 2 => {1, 3} 2 => {0, 3} 2 3 => {2, 4} 3 => {2, 4} 3 => {2, 4} 3 4 => {3} 4 => {3} 4 => {3} 4 ------------------------------------------------------------------------ => {1, 2}}, Graph{0 => {1, 2} }} => {0, 2} 1 => {0, 2} => {1, 0} 2 => {1, 0, 3} => {4} 3 => {2} => {3} 4 => {} o1 : List```

If the List input format is used, then one should use care as the list may contain isomorphic pairs.