Graph Theory Crossword

A graph with no cycles.
On a graph G, a set S ⊆ V(G) such that G - S has more than one component.
Of a graph G, is a set Q ⊆ V(G) that contains at least one endpoint of every edge.
A set of non-loop edges with no shared endpoints in a graph.
A simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the list.
Two paths from u to v who have no common internal vertex.
A vertex of degree 1.
An X,Y - bigraph G has a matching that saturates X if and only if |N(S)| ≥ |S| for all S ⊆ X.
A set of pairwise nonadjacent vertices of a graph.
A graph if it has a closed trail containing all edges.
A spanning subgraph of a graph G.
A set L of edges such that every vertex of a graph G is incident to some edge of L.
A set of edges F ⊆ E(G) such that G - F has more than one component.
A maximal path whose internal vertices have degree 2 in a graph G.
A graph with an equal number of vertices and edges whose vertices can be placed around a circle so that two vertices are adjacent if and only if they appear consecutively along the circle.
The minimum size of a vertex cut.
A set of pairwise adjacent vertices in a graph.
A tree in which a single path is incident to every edge.
A graph G if V(G) is the union of two disjoint independent sets.